Submission #11619104


Source Code Expand

// #pragma GCC target("avx2")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
using namespace std;
const long long mod=998244353;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3121000;
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
long long Comb(int a,int b){
 	if(a<b||b<0)return 0;
 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
}
void init_C(int n){
	fact[0]=finv[0]=inv[1]=1;
	for(int i=2;i<n;i++){
		inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
	}
	for(int i=1;i<n;i++){
		fact[i]=fact[i-1]*i%mod;
		finv[i]=finv[i-1]*inv[i]%mod;
	}
}
long long pw(long long a,long long b){
	if(a<0LL)return 0;
	if(b<0LL)return 0;
	long long ret=1;
	while(b){
		if(b%2)ret=ret*a%mod;
		a=a*a%mod;
		b/=2;
	}
	return ret;
}
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
double ABS(double a){return max(a,-a);}
int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
// ここから編集しろ
int p[210000];
int n;
int sum[210000];
map<pair<int,int>,int>dp;
int calc(int a,int b){
	if(dp.count(make_pair(a,b)))return dp[make_pair(a,b)];
	if(a==n-3)return b;
	if(b<p[n-2-a]){
		return dp[make_pair(a,b)]=calc(a+1,p[n-2-a]-b);
	}
	int ret=0;
	int at=upper_bound(sum,sum+n-2,sum[a]+b)-sum-1;
	int tb=b-(sum[at]-sum[a]);
	ret=calc(at,tb);
	return dp[make_pair(a,b)]=ret;
}
int main(){
	int a;scanf("%d",&a);
	n=a;
	for(int i=0;i<a-1;i++){
		scanf("%d",p+i);
	}
	for(int i=0;i<a-1;i++){
		sum[i+1]=sum[i]+p[a-2-i];
	}
	int b;scanf("%d",&b);
	for(int i=0;i<b;i++){
		int x;scanf("%d",&x);
		int ret=calc(0,x)+p[0]-p[1];
		printf("%d\n",ret);
	}
}

Submission Info

Submission Time
Task H - Tokaido
User tozangezan
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 2196 Byte
Status AC
Exec Time 882 ms
Memory 79488 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:79:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a;scanf("%d",&a);
                      ^
./Main.cpp:82:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",p+i);
                  ^
./Main.cpp:87:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int b;scanf("%d",&b);
                      ^
./Main.cpp:89:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x;scanf("%d",&x);
                       ^

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 700 / 700 900 / 900
Status
AC × 2
AC × 20
AC × 39
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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 17 ms 1792 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 2 ms 512 KB
01-04.txt AC 44 ms 13440 KB
01-05.txt AC 22 ms 4480 KB
01-06.txt AC 92 ms 24704 KB
01-07.txt AC 6 ms 896 KB
01-08.txt AC 78 ms 21760 KB
01-09.txt AC 53 ms 14848 KB
01-10.txt AC 1 ms 256 KB
01-11.txt AC 4 ms 512 KB
01-12.txt AC 16 ms 1792 KB
01-13.txt AC 17 ms 1792 KB
01-14.txt AC 18 ms 2304 KB
01-15.txt AC 20 ms 3328 KB
01-16.txt AC 17 ms 1792 KB
01-17.txt AC 17 ms 1792 KB
01-18.txt AC 17 ms 1792 KB
01-19.txt AC 17 ms 1792 KB
02-01.txt AC 42 ms 8320 KB
02-02.txt AC 416 ms 52608 KB
02-03.txt AC 840 ms 77568 KB
02-04.txt AC 824 ms 79488 KB
02-05.txt AC 791 ms 59136 KB
02-06.txt AC 882 ms 78592 KB
02-07.txt AC 844 ms 77184 KB
02-08.txt AC 491 ms 45312 KB
02-09.txt AC 624 ms 54400 KB
02-10.txt AC 518 ms 47104 KB
02-11.txt AC 586 ms 52096 KB
02-12.txt AC 552 ms 48512 KB
02-13.txt AC 567 ms 49280 KB
02-14.txt AC 410 ms 39808 KB
02-15.txt AC 176 ms 15488 KB
02-16.txt AC 175 ms 15488 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB