Submission #6427943
Source Code Expand
#include<bits/stdc++.h> //ios::sync_with_stdio(false); //cin.tie(0); using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<pii,int> ppii; typedef pair<int,pii> pipi; typedef pair<ll,ll> pll; typedef pair<pll,ll> plpl; typedef tuple<ll,ll,ll> tl; ll mod=1000000007; ll mod2=998244353; ll inf=1000000000000000000; double pi=2*acos(0); #define rep(i,m,n) for(int i=m;i<n;i++) #define rrep(i,n,m) for(int i=n;i>=m;i--) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; ll lmax(ll a,ll b){ if(a<b)return b; else return a; } ll lmin(ll a,ll b){ if(a<b)return a; else return b; } ll gya[200010]; ll kai[200010]; ll beki(ll n,ll k){ ll ret=1; ll now=n; while(k>0){ if(k%2==1){ ret*=now; ret%=mod2; } now*=now; now%=mod2; k/=2; } return ret; } ll gyaku(ll n){ return beki(n,mod2-2); } void nckinit(ll n){ kai[0]=1; kai[1]=1; for(int i=2;i<=n;i++){ kai[i]=kai[i-1]*i; kai[i]%=mod2; } gya[n]=gyaku(kai[n]); for(int i=n-1;i>=1;i--){ gya[i]=gya[i+1]*(i+1); gya[i]%=mod2; } gya[0]=1; } ll nck(ll n,ll k){ if(k<0)return 0; if(k==0||n==k)return 1; ll ret=kai[n]; ret*=gya[n-k]; ret%=mod2; ret*=gya[k]; ret%=mod2; return ret; } ll npk(ll n,ll k){ if(k<0)return 0; if(k==0)return 1; ll ret=kai[n]; ret*=gya[n-k]; ret%=mod; return ret; } int main(){ int n;cin>>n; int d[n]; int ma=0; rep(i,0,n){ cin>>d[i]; ma+=d[i]; } sort(d,d+n); int u=ma-d[n-1]; int mi; if(u>=d[n-1])mi=0; else mi=d[n-1]-u; cout<<ma<<endl; cout<<mi<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 2点間距離の最大と最小 ( Maximum and Minimum ) |
User | ttttan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1888 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 |