Submission #1369775


Source Code Expand

#include <bits/stdc++.h>

#define lld long long
#define pp pair<int,int>
#define pb push_back
#define MOD 10007
#define left lleft
#define right rright
#define INF 2000000000
#define Linf 1000000000000000000LL
#define next nnext

using namespace std;

int N,K,ans;
int a[5002];
bool check[5002];

int main(){
	scanf("%d %d",&N,&K);
	for(int i=1; i<=N; i++) scanf("%d",&a[i]);
	int t = 0; lld sum = 0;
	for(int i=1; i<=N; i++){
		if(t < i){
			sum = a[i];
			t = i;
		}
		while(1){
			if(t == N || sum >= K) break;
			sum += a[++t];
		}
		if(sum < K) break;
		for(int j=i; j<=t; j++){
			if(sum-a[j] < K) check[j] = true;
		}
	}
	for(int i=1; i<=N; i++) if(!check[i]) ans++;
	printf("%d\n",ans);

	return 0;
}

Submission Info

Submission Time
Task D - No Need
User suhgyuho
Language C++14 (GCC 5.4.1)
Score 0
Code Size 750 Byte
Status WA
Exec Time 10 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&N,&K);
                      ^
./Main.cpp:21:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; i++) scanf("%d",&a[i]);
                                           ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 300
Status
AC × 3
AC × 21
WA × 5
AC × 40
WA × 11
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
Subtask 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt, 2_041.txt, 2_042.txt, 2_043.txt, 2_044.txt, 2_045.txt, 2_046.txt, 2_047.txt, 2_048.txt, 2_049.txt, 2_050.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 1 ms 256 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 1 ms 256 KB
1_012.txt AC 1 ms 256 KB
1_013.txt AC 1 ms 256 KB
1_014.txt AC 1 ms 256 KB
1_015.txt WA 1 ms 256 KB
1_016.txt AC 1 ms 256 KB
1_017.txt AC 1 ms 256 KB
1_018.txt AC 1 ms 256 KB
1_019.txt AC 1 ms 256 KB
1_020.txt WA 1 ms 256 KB
1_021.txt WA 1 ms 256 KB
1_022.txt WA 1 ms 256 KB
1_023.txt WA 1 ms 256 KB
1_024.txt AC 1 ms 256 KB
1_025.txt AC 1 ms 256 KB
2_026.txt AC 1 ms 256 KB
2_027.txt AC 1 ms 256 KB
2_028.txt AC 1 ms 256 KB
2_029.txt AC 10 ms 256 KB
2_030.txt AC 2 ms 256 KB
2_031.txt AC 2 ms 256 KB
2_032.txt AC 2 ms 256 KB
2_033.txt AC 2 ms 256 KB
2_034.txt AC 2 ms 256 KB
2_035.txt AC 2 ms 256 KB
2_036.txt WA 2 ms 256 KB
2_037.txt AC 1 ms 256 KB
2_038.txt AC 1 ms 256 KB
2_039.txt AC 1 ms 256 KB
2_040.txt AC 2 ms 256 KB
2_041.txt WA 2 ms 256 KB
2_042.txt WA 2 ms 256 KB
2_043.txt WA 2 ms 256 KB
2_044.txt WA 2 ms 256 KB
2_045.txt WA 2 ms 256 KB
2_046.txt AC 2 ms 256 KB
2_047.txt AC 2 ms 256 KB
2_048.txt AC 2 ms 256 KB
2_049.txt AC 2 ms 256 KB
2_050.txt AC 2 ms 256 KB