Submission #35683
Source Code Expand
//template ver2.00 //------------------------------------------ //include //------------------------------------------ #include <vector> #include <map> #include <set> #include <stack> #include <queue> #include <algorithm> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <string> #include <cstring> #include <complex> using namespace std; //conversion //------------------------------------------ inline int to_int(string s) {int v; istringstream sin(s); sin >> v; return v;} template<class T> inline string to_str(T x) {ostringstream sout; sout << x; return sout.str();} //math //------------------------------------------- template<class T> inline T sqr(T x) {return x*x;} template<class T> inline T is_inner(T x, T a, T b) {return a <= x && x < b;} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; //container util //------------------------------------------ #define MP make_pair #define EACH(i, c) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i) #define EXIST(c, e) ((c).find(e) != (c).end()) //repetition //------------------------------------------ #define FOR(i, a, b) for (int i = (a);i < (b); ++i) #define REP(i, n) FOR(i, 0, n) //IO //------------------------------------------ #define LF(x) cout << (x) << endl; #define LFA(a, n) cout << a[0]; FOR(itr, 1, n) {cout << " " << a[itr];} cout << endl; #define LFP(x, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << (x) << endl; //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); const int INF = 1e9; const int DI[] = {0, 1, 0, -1}; const int DJ[] = {1, 0, -1, 0}; //clear memory //-------------------------------------------- #define CLR(a) memset((a), 0 , sizeof(a)) //debug //-------------------------------------------- #define DUMP(x) cerr << #x << " = " << (x) << endl; #define DUMPA(a, n) cerr << #a << " = {" << a[0]; FOR(itr, 1, n) { cout << ", " << a[itr]; } cerr << "}" << endl; #define DUMPAA(a, n, m) REP(itr, n) {REP(jtr, m) {cout << a[itr][jtr] << " ";} cout << endl;} const int N = 500; int n; int d[N]; void init() { } void solve() { int ans0 = 0; int ans1 = 0; REP(i, n) { if (is_inner(d[i], ans1, ans0 + 1)) { ans1 = 0; } else { ans1 = min(abs(ans1 - d[i]), abs(ans0 - d[i])); } ans0 += d[i]; } LF(ans0); LF(ans1); } int main() { init(); cin >> n; REP(i, n) cin >> d[i]; solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 2点間距離の最大と最小 ( Maximum and Minimum ) |
User | wotsushi |
Language | C++ (GCC 4.4.7) |
Score | 100 |
Code Size | 2780 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 940 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 02_rnd2_20.txt, 02_rnd2_21.txt, 02_rnd2_22.txt, 02_rnd2_23.txt, 02_rnd2_24.txt, 02_rnd2_25.txt, 02_rnd2_26.txt, 02_rnd2_27.txt, 02_rnd2_28.txt, 02_rnd2_29.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 04_maxret_01.txt, 04_maxret_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 33 ms | 888 KB |
00_sample_02.txt | AC | 25 ms | 804 KB |
00_sample_03.txt | AC | 23 ms | 844 KB |
00_sample_04.txt | AC | 22 ms | 936 KB |
00_sample_05.txt | AC | 25 ms | 912 KB |
01_rnd_00.txt | AC | 24 ms | 908 KB |
01_rnd_01.txt | AC | 24 ms | 912 KB |
01_rnd_02.txt | AC | 22 ms | 908 KB |
01_rnd_03.txt | AC | 24 ms | 916 KB |
01_rnd_04.txt | AC | 22 ms | 912 KB |
01_rnd_05.txt | AC | 21 ms | 812 KB |
01_rnd_06.txt | AC | 24 ms | 840 KB |
01_rnd_07.txt | AC | 24 ms | 788 KB |
01_rnd_08.txt | AC | 24 ms | 940 KB |
01_rnd_09.txt | AC | 24 ms | 908 KB |
01_rnd_10.txt | AC | 23 ms | 820 KB |
01_rnd_11.txt | AC | 23 ms | 916 KB |
01_rnd_12.txt | AC | 21 ms | 912 KB |
01_rnd_13.txt | AC | 21 ms | 912 KB |
01_rnd_14.txt | AC | 23 ms | 808 KB |
01_rnd_15.txt | AC | 24 ms | 912 KB |
02_rnd2_00.txt | AC | 24 ms | 912 KB |
02_rnd2_01.txt | AC | 21 ms | 908 KB |
02_rnd2_02.txt | AC | 24 ms | 912 KB |
02_rnd2_03.txt | AC | 24 ms | 912 KB |
02_rnd2_04.txt | AC | 24 ms | 760 KB |
02_rnd2_05.txt | AC | 21 ms | 912 KB |
02_rnd2_06.txt | AC | 23 ms | 908 KB |
02_rnd2_07.txt | AC | 23 ms | 916 KB |
02_rnd2_08.txt | AC | 21 ms | 908 KB |
02_rnd2_09.txt | AC | 32 ms | 808 KB |
02_rnd2_10.txt | AC | 24 ms | 908 KB |
02_rnd2_11.txt | AC | 22 ms | 836 KB |
02_rnd2_12.txt | AC | 23 ms | 908 KB |
02_rnd2_13.txt | AC | 21 ms | 916 KB |
02_rnd2_14.txt | AC | 23 ms | 908 KB |
02_rnd2_15.txt | AC | 24 ms | 912 KB |
02_rnd2_16.txt | AC | 23 ms | 912 KB |
02_rnd2_17.txt | AC | 22 ms | 840 KB |
02_rnd2_18.txt | AC | 23 ms | 916 KB |
02_rnd2_19.txt | AC | 23 ms | 844 KB |
02_rnd2_20.txt | AC | 23 ms | 908 KB |
02_rnd2_21.txt | AC | 23 ms | 912 KB |
02_rnd2_22.txt | AC | 23 ms | 844 KB |
02_rnd2_23.txt | AC | 24 ms | 908 KB |
02_rnd2_24.txt | AC | 24 ms | 908 KB |
02_rnd2_25.txt | AC | 21 ms | 832 KB |
02_rnd2_26.txt | AC | 23 ms | 904 KB |
02_rnd2_27.txt | AC | 24 ms | 764 KB |
02_rnd2_28.txt | AC | 24 ms | 908 KB |
02_rnd2_29.txt | AC | 23 ms | 916 KB |
03_max_00.txt | AC | 23 ms | 832 KB |
03_max_01.txt | AC | 22 ms | 912 KB |
03_max_02.txt | AC | 23 ms | 912 KB |
03_max_03.txt | AC | 24 ms | 916 KB |
03_max_04.txt | AC | 22 ms | 912 KB |
03_max_05.txt | AC | 24 ms | 916 KB |
03_max_06.txt | AC | 23 ms | 912 KB |
03_max_07.txt | AC | 22 ms | 912 KB |
03_max_08.txt | AC | 22 ms | 916 KB |
03_max_09.txt | AC | 27 ms | 828 KB |
04_maxret_01.txt | AC | 24 ms | 912 KB |
04_maxret_02.txt | AC | 22 ms | 908 KB |