Submission #23046
Source Code Expand
#include <map> #include <set> #include <cmath> #include <stack> #include <queue> #include <string> #include <vector> #include <bitset> #include <fstream> #include <sstream> #include <stdio.h> #include <ctype.h> #include <string.h> #include <iostream> #include <algorithm> using namespace std; #define li long long int #define rep(i,to) for(li i=0;i<((li)(to));++i) #define pb push_back #define sz(v) ((li)(v).size()) #define bit(n) (1ll<<(li)(n)) #define all(vec) (vec).begin(),(vec).end() #define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++) #define MP make_pair #define F first #define S second int main() { /* li n; cin >> n; vector<double> d(n); rep(i, n) cin >> d[i]; double maxi = 0; double sum = 0; rep(i, n) sum += d[i]; rep(i, n) maxi = max(maxi, d[i] - (sum - d[i])); printf("%0.30lf\n", sum); printf("%0.30lf\n", maxi); */ li n; cin >> n; vector<li> d(n); rep(i, n) cin >> d[i]; li maxi = 0; li sum = 0; rep(i, n) sum += d[i]; rep(i, n) maxi = max(maxi, d[i] - (sum - d[i])); cout << sum << endl; cout << maxi << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 2点間距離の最大と最小 ( Maximum and Minimum ) |
User | Komaki |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1179 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 816 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 | 22 ms | 816 KB |
00_sample_02.txt | AC | 22 ms | 788 KB |
00_sample_03.txt | AC | 22 ms | 780 KB |
00_sample_04.txt | AC | 22 ms | 796 KB |
00_sample_05.txt | AC | 21 ms | 816 KB |
01_rnd_00.txt | AC | 22 ms | 788 KB |
01_rnd_01.txt | AC | 22 ms | 788 KB |
01_rnd_02.txt | AC | 22 ms | 764 KB |
01_rnd_03.txt | AC | 22 ms | 740 KB |
01_rnd_04.txt | AC | 22 ms | 776 KB |
01_rnd_05.txt | AC | 20 ms | 728 KB |
01_rnd_06.txt | AC | 21 ms | 788 KB |
01_rnd_07.txt | AC | 22 ms | 736 KB |
01_rnd_08.txt | AC | 21 ms | 792 KB |
01_rnd_09.txt | AC | 23 ms | 808 KB |
01_rnd_10.txt | AC | 21 ms | 732 KB |
01_rnd_11.txt | AC | 22 ms | 792 KB |
01_rnd_12.txt | AC | 21 ms | 792 KB |
01_rnd_13.txt | AC | 22 ms | 788 KB |
01_rnd_14.txt | AC | 22 ms | 736 KB |
01_rnd_15.txt | AC | 21 ms | 792 KB |
02_rnd2_00.txt | AC | 21 ms | 788 KB |
02_rnd2_01.txt | AC | 21 ms | 800 KB |
02_rnd2_02.txt | AC | 22 ms | 776 KB |
02_rnd2_03.txt | AC | 21 ms | 812 KB |
02_rnd2_04.txt | AC | 22 ms | 784 KB |
02_rnd2_05.txt | AC | 22 ms | 764 KB |
02_rnd2_06.txt | AC | 20 ms | 788 KB |
02_rnd2_07.txt | AC | 21 ms | 788 KB |
02_rnd2_08.txt | AC | 21 ms | 792 KB |
02_rnd2_09.txt | AC | 21 ms | 784 KB |
02_rnd2_10.txt | AC | 22 ms | 788 KB |
02_rnd2_11.txt | AC | 23 ms | 784 KB |
02_rnd2_12.txt | AC | 21 ms | 788 KB |
02_rnd2_13.txt | AC | 22 ms | 792 KB |
02_rnd2_14.txt | AC | 22 ms | 764 KB |
02_rnd2_15.txt | AC | 22 ms | 760 KB |
02_rnd2_16.txt | AC | 22 ms | 796 KB |
02_rnd2_17.txt | AC | 22 ms | 792 KB |
02_rnd2_18.txt | AC | 22 ms | 796 KB |
02_rnd2_19.txt | AC | 21 ms | 788 KB |
02_rnd2_20.txt | AC | 22 ms | 816 KB |
02_rnd2_21.txt | AC | 22 ms | 796 KB |
02_rnd2_22.txt | AC | 21 ms | 756 KB |
02_rnd2_23.txt | AC | 21 ms | 780 KB |
02_rnd2_24.txt | AC | 22 ms | 736 KB |
02_rnd2_25.txt | AC | 22 ms | 740 KB |
02_rnd2_26.txt | AC | 22 ms | 796 KB |
02_rnd2_27.txt | AC | 20 ms | 792 KB |
02_rnd2_28.txt | AC | 22 ms | 788 KB |
02_rnd2_29.txt | AC | 21 ms | 788 KB |
03_max_00.txt | AC | 20 ms | 788 KB |
03_max_01.txt | AC | 21 ms | 784 KB |
03_max_02.txt | AC | 22 ms | 788 KB |
03_max_03.txt | AC | 22 ms | 772 KB |
03_max_04.txt | AC | 21 ms | 792 KB |
03_max_05.txt | AC | 22 ms | 764 KB |
03_max_06.txt | AC | 22 ms | 792 KB |
03_max_07.txt | AC | 21 ms | 816 KB |
03_max_08.txt | AC | 22 ms | 788 KB |
03_max_09.txt | AC | 21 ms | 784 KB |
04_maxret_01.txt | AC | 22 ms | 784 KB |
04_maxret_02.txt | AC | 21 ms | 768 KB |