Submission #2949826
Source Code Expand
/* _ooOoo_ o8888888o 88" . "88 (| -_- |) O\ = /O ____/`---'\____ .' \\| |// `. / \\||| : |||// \ / _||||| -:- |||||- \ | | \\\ - /// | | | \_| ''\---/'' | | \ .-\__ `-` ___/-. / ___`. .' /--.--\ `. . ___ ."" '< `.___\_<|>_/___.' >'"". | | : `- \`.;`\ _ /`;.`/ - ` : | | \ \ `-. \_ __\ /__ _/ .-` / / ======`-.____`-.___\_____/___.-`____.-'====== `=---=' ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ·ð×æ±£ÓÓ ÓÀÎÞBUG */ //use readint! #pragma GCC optimize(1) #pragma G++ optimize(1) #pragma GCC optimize(2) #pragma G++ optimize(2) #pragma GCC optimize(3) #pragma G++ optimize(3) #pragma GCC optimize(4) #pragma G++ optimize(4) #pragma GCC optimize(5) #pragma G++ optimize(5) #pragma GCC optimize(6) #pragma G++ optimize(6) #pragma GCC optimize(7) #pragma G++ optimize(7) #pragma GCC optimize(8) #pragma G++ optimize(8) #pragma GCC optimize(9) #pragma G++ optimize(9) #pragma GCC optimize("-funsafe-loop-optimizations") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-fwhole-program") #pragma GCC optimize("Ofast,no-stack-protector") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fcse-follow-jumps") #pragma GCC optimize("-fcse-skip-blocks") #pragma GCC optimize("-fdelete-null-pointer-checks") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fexpensive-optimizations") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("-fschedule-insns2") #pragma GCC optimize("-fstrict-aliasing") #pragma GCC optimize("-fstrict-overflow") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #include<map> #include<iostream> #include<iomanip> //#include<conio.h> #include<algorithm> #include<vector> #include<set> #include<cmath> #include<stdio.h> #include<fstream> #include<assert.h> #include<time.h> #include<queue> #include<deque> #include<stack> #include<list> //#include<windows.h> #include<sstream> #include<string.h> #define mp make_pair #define ll long long #define all(v) v.begin(),v.end() #define memset(a,b) memset(a,b,sizeof(a)) using namespace std; const int INF=2147483647; const int maxn=10005; struct bign{ int d[maxn], len; inline void clean() { while(len > 1 && !d[len-1]) len--; } inline bign() { memset(d, 0); len=1; } inline bign(int num) { *this=num; } inline bign(char* num) { *this=num; } inline bign operator=(const char* num){ memset(d, 0); len=strlen(num); for(int i=0; i<len; i++) d[i]=num[len-1-i] - '0'; clean(); return *this; } inline bign operator=(int num){ char s[20]; sprintf(s, "%d", num); *this=s; return *this; } inline bign operator + (const bign& b){ bign c=*this; int i; for (i=0; i<b.len; i++){ c.d[i] +=b.d[i]; if (c.d[i] > 9) c.d[i]%=10, c.d[i+1]++; } while (c.d[i] > 9) c.d[i++]%=10, c.d[i]++; c.len=max(len, b.len); if (c.d[i] && c.len<=i) c.len=i+1; return c; } inline bign operator - (const bign& b){ bign c=*this; int i; for (i=0; i<b.len; i++){ c.d[i] -=b.d[i]; if (c.d[i]<0) c.d[i]+=10, c.d[i+1]--; } while (c.d[i]<0) c.d[i++]+=10, c.d[i]--; for(i=c.len-1;i>0;i--) if(c.d[i]!=0) break; c.len=i+1; // c.clean(); return c; } inline bign operator * (const bign& b)const{ int i, j; bign c; c.len=len + b.len; for(j=0; j<b.len; j++) for(i=0; i<len; i++) c.d[i+j] +=d[i] * b.d[j]; for(i=0; i<c.len-1; i++) c.d[i+1] +=c.d[i]/10, c.d[i] %=10; c.clean(); return c; } inline bign operator / (const bign& b){ int i, j; bign c=*this, a=0; for (i=len - 1; i >=0; i--) { a=a*10 + d[i]; for (j=0; j<10; j++) if (a<b*(j+1)) break; c.d[i]=j; a=a - b*j; } c.clean(); return c; } inline bign operator % (const bign& b){ int i, j; bign a=0; for (i=len-1;i>=0;i--){ a=a*10 + d[i]; for (j=0; j<10; j++) if (a<b*(j+1)) break; a=a - b*j; } return a; } inline bign operator += (const bign& b){ *this=*this + b; return *this; } inline bign operator *= (const bign& b){ *this=*this * b; return *this; } inline bign operator -= (const bign& b){ *this=*this - b; return *this; } inline bign operator /= (const bign& b){ *this=*this / b; return *this; } inline bool operator < (const bign& b) const{ if(len !=b.len) return len<b.len; for(int i=len-1; i >=0; i--) if(d[i] !=b.d[i]) return d[i]<b.d[i]; return false; } inline bool operator >(const bign& b) const{return b<*this;} inline bool operator<=(const bign& b) const{return !(b<*this);} inline bool operator>=(const bign& b) const{return !(*this<b);} inline bool operator!=(const bign& b) const{return b<*this || *this<b;} inline bool operator==(const bign& b) const{return !(b<*this) && !(b > *this);} inline string str() const{ char s[maxn]={}; for(int i=0; i<len; i++) s[len-1-i]=d[i]+'0'; return s; } }; inline istream& operator >>(istream& in, bign& x) { string s; in>>s; x=s.c_str(); return in; } inline ostream& operator << (ostream& out, const bign& x) { out<<x.str(); return out; } inline void write(ll x){ if(x<0) putchar('-'),x=-x; if(x>9) write(x/10); putchar(x%10+'0'); } inline int pt(int a[],int l,int r){ int p,i,j; p=a[l]; i=l; j=r+1; for(;;){ while(a[++i]<p) if(i>=r) break; while(a[--j]>p) if(j<=l) break; if(i>=j) break; else swap(a[i],a[j]); } if(j==l) return j; swap(a[l],a[j]); return j; } inline void q_sort(int a[],int l,int r){ int q; if(r>l){ q=pt(a,l,r); q_sort(a,l,q-1); q_sort(a,q+1,r); } } inline void write(int x){ if(x<0) putchar('-'),x=-x; if(x>9) write(x/10); putchar(x%10+'0'); } inline void rd(long long &val){ long long x=0; int f=1; char ch=getchar(); while((ch<'0'||ch>'9')&&ch!='-') ch=getchar(); if(ch=='-'){ f=-1; ch=getchar(); } while(ch>='0'&&ch<='9'){ x=x*10+ch-'0'; ch=getchar(); } val=x*f; } inline void rd(int &val){ int x=0; int f=1; char ch=getchar(); while((ch<'0'||ch>'9')&&ch!='-') ch=getchar(); if(ch=='-'){ f=-1; ch=getchar(); } while(ch>='0'&&ch<='9'){ x=x*10+ch-'0'; ch=getchar(); } val=x*f; } inline void print(int x){ write(x); putchar('\n'); } int main(){ ios_base::sync_with_stdio(false); int i,j,n,x,mx=0,sum=0; cin>>n; while(n--){ cin>>x; sum+=x; mx=max(mx,x); } cout<<sum<<endl<<max(0,mx*2-sum)<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 2点間距離の最大と最小 ( Maximum and Minimum ) |
User | luogu_bot1 |
Language | C++ (GCC 5.4.1) |
Score | 100 |
Code Size | 8290 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
00_sample_04.txt | AC | 1 ms | 256 KB |
00_sample_05.txt | AC | 1 ms | 256 KB |
01_rnd_00.txt | AC | 1 ms | 256 KB |
01_rnd_01.txt | AC | 1 ms | 256 KB |
01_rnd_02.txt | AC | 1 ms | 256 KB |
01_rnd_03.txt | AC | 1 ms | 256 KB |
01_rnd_04.txt | AC | 1 ms | 256 KB |
01_rnd_05.txt | AC | 1 ms | 256 KB |
01_rnd_06.txt | AC | 1 ms | 256 KB |
01_rnd_07.txt | AC | 1 ms | 256 KB |
01_rnd_08.txt | AC | 1 ms | 256 KB |
01_rnd_09.txt | AC | 1 ms | 256 KB |
01_rnd_10.txt | AC | 1 ms | 256 KB |
01_rnd_11.txt | AC | 1 ms | 256 KB |
01_rnd_12.txt | AC | 1 ms | 256 KB |
01_rnd_13.txt | AC | 1 ms | 256 KB |
01_rnd_14.txt | AC | 1 ms | 256 KB |
01_rnd_15.txt | AC | 1 ms | 256 KB |
02_rnd2_00.txt | AC | 1 ms | 256 KB |
02_rnd2_01.txt | AC | 1 ms | 256 KB |
02_rnd2_02.txt | AC | 1 ms | 256 KB |
02_rnd2_03.txt | AC | 1 ms | 256 KB |
02_rnd2_04.txt | AC | 1 ms | 256 KB |
02_rnd2_05.txt | AC | 1 ms | 256 KB |
02_rnd2_06.txt | AC | 1 ms | 256 KB |
02_rnd2_07.txt | AC | 1 ms | 256 KB |
02_rnd2_08.txt | AC | 1 ms | 256 KB |
02_rnd2_09.txt | AC | 1 ms | 256 KB |
02_rnd2_10.txt | AC | 1 ms | 256 KB |
02_rnd2_11.txt | AC | 1 ms | 256 KB |
02_rnd2_12.txt | AC | 1 ms | 256 KB |
02_rnd2_13.txt | AC | 1 ms | 256 KB |
02_rnd2_14.txt | AC | 1 ms | 256 KB |
02_rnd2_15.txt | AC | 1 ms | 256 KB |
02_rnd2_16.txt | AC | 1 ms | 256 KB |
02_rnd2_17.txt | AC | 1 ms | 256 KB |
02_rnd2_18.txt | AC | 1 ms | 256 KB |
02_rnd2_19.txt | AC | 1 ms | 256 KB |
02_rnd2_20.txt | AC | 1 ms | 256 KB |
02_rnd2_21.txt | AC | 1 ms | 256 KB |
02_rnd2_22.txt | AC | 1 ms | 256 KB |
02_rnd2_23.txt | AC | 1 ms | 256 KB |
02_rnd2_24.txt | AC | 1 ms | 256 KB |
02_rnd2_25.txt | AC | 1 ms | 256 KB |
02_rnd2_26.txt | AC | 1 ms | 256 KB |
02_rnd2_27.txt | AC | 1 ms | 256 KB |
02_rnd2_28.txt | AC | 1 ms | 256 KB |
02_rnd2_29.txt | AC | 1 ms | 256 KB |
03_max_00.txt | AC | 1 ms | 256 KB |
03_max_01.txt | AC | 1 ms | 256 KB |
03_max_02.txt | AC | 1 ms | 256 KB |
03_max_03.txt | AC | 1 ms | 256 KB |
03_max_04.txt | AC | 1 ms | 256 KB |
03_max_05.txt | AC | 1 ms | 256 KB |
03_max_06.txt | AC | 1 ms | 256 KB |
03_max_07.txt | AC | 1 ms | 256 KB |
03_max_08.txt | AC | 1 ms | 256 KB |
03_max_09.txt | AC | 1 ms | 256 KB |
04_maxret_01.txt | AC | 1 ms | 256 KB |
04_maxret_02.txt | AC | 1 ms | 256 KB |