Submission #1017129
Source Code Expand
#define DEB
#include<bits/stdc++.h>
#define REP(i,m) for(int i=0;i<(m);++i)
#define REPN(i,m,in) for(int i=(in);i<(m);++i)
#define ALL(t) (t).begin(),(t).end()
#define CLR(a) memset((a),0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
using namespace std;
#ifdef DEB
#define dump(x) cerr << #x << " = " << (x) << endl
#define prl cerr<<"called:"<< __LINE__<<endl
template<class T> void debug(T a,T b){ for(;a!=b;++a) cerr<<*a<<' ';cerr<<endl;}
#else
#define dump(x) ;
#define prl ;
template<class T> void debug(T a,T b){ ;}
#endif
template<class T> void chmin(T& a,const T& b) { if(a>b) a=b; }
template<class T> void chmax(T& a,const T& b) { if(a<b) a=b; }
typedef long long int lint;
typedef pair<int,int> pi;
namespace std{
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
out<<'('<<a.fr<<','<<a.sc<<')';
return out;
}
}
//const int INF=5e8;
int n,m;
int ar[200005];
int xs[200005];
int dp[2000005];
int main(){
cin>>n;
int sum=0;
REP(i,n-1) scanf("%d",&ar[i]),sum+=ar[i];
sum-=ar[0]+ar[1];
const int MX=1000002;
int s=1000000;
REP(i,MX) dp[s+i]=i;
REPN(i,n-1,2){
int p=ar[i];
REP(j,p) dp[s-1-j]=dp[s+j+1];
s-=p;
}
cin>>m;
REP(i,m){
int x;
scanf("%d",&x);
int res;
if(x>=MX){
res=x-sum;
}else{
res=dp[s+x];
}
res+=ar[0]-ar[1];
printf("%d\n",res);
}
return 0;
}
Submission Info
Submission Time
2016-12-10 11:06:29+0900
Task
H - Tokaido
User
hogloid
Language
C++14 (GCC 5.4.1)
Score
1600
Code Size
1525 Byte
Status
AC
Exec Time
75 ms
Memory
10752 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:49:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n-1) scanf("%d",&ar[i]),sum+=ar[i];
^
./Main.cpp:63:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&x);
^
Judge Result
Set Name
sample
dataset1
dataset2
Score / Max Score
0 / 0
700 / 700
900 / 900
Status
Set Name
Test Cases
sample
sample-01.txt, sample-02.txt
dataset1
sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt
dataset2
sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt
Case Name
Status
Exec Time
Memory
01-01.txt
AC
27 ms
8832 KB
01-02.txt
AC
7 ms
4096 KB
01-03.txt
AC
11 ms
8064 KB
01-04.txt
AC
19 ms
8448 KB
01-05.txt
AC
27 ms
8832 KB
01-06.txt
AC
27 ms
8832 KB
01-07.txt
AC
16 ms
8320 KB
01-08.txt
AC
28 ms
8832 KB
01-09.txt
AC
28 ms
8832 KB
01-10.txt
AC
11 ms
8064 KB
01-11.txt
AC
14 ms
8192 KB
01-12.txt
AC
27 ms
8832 KB
01-13.txt
AC
28 ms
8832 KB
01-14.txt
AC
28 ms
8832 KB
01-15.txt
AC
28 ms
8832 KB
01-16.txt
AC
26 ms
8832 KB
01-17.txt
AC
21 ms
4992 KB
01-18.txt
AC
21 ms
4992 KB
01-19.txt
AC
21 ms
4992 KB
02-01.txt
AC
19 ms
8448 KB
02-02.txt
AC
75 ms
10752 KB
02-03.txt
AC
68 ms
9344 KB
02-04.txt
AC
68 ms
9216 KB
02-05.txt
AC
52 ms
8832 KB
02-06.txt
AC
67 ms
9216 KB
02-07.txt
AC
68 ms
9472 KB
02-08.txt
AC
55 ms
9344 KB
02-09.txt
AC
57 ms
9344 KB
02-10.txt
AC
63 ms
9728 KB
02-11.txt
AC
71 ms
10112 KB
02-12.txt
AC
70 ms
10112 KB
02-13.txt
AC
71 ms
10112 KB
02-14.txt
AC
69 ms
10240 KB
02-15.txt
AC
65 ms
6528 KB
02-16.txt
AC
64 ms
6528 KB
sample-01.txt
AC
7 ms
4096 KB
sample-02.txt
AC
6 ms
4224 KB