Submission #48084859
Source Code Expand
#include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i,n) for(_loop_int i=0; i<(_loop_int)(n); i++)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a); i<(_loop_int)(b); i++)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1; i>=(_loop_int)(a); i--)
#define CHMIN(a,b) (a)=min((a),(b))
#define CHMAX(a,b) (a)=max((a),(b))
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) cerr<<#x<<": "<<(x)<<endl
#define DEBUG_VEC(v) cerr<<#v<<": ";REP(__i,(v).size())cerr<<((v)[__i])<<", ";cerr<<endl
const ll MOD = 1000000007ll;
int n,k,t;
int a[452521];
int b[452521];
int main(){
scanf("%d%d%d",&n,&k,&t);
REP(i,k)scanf("%d",a+i),a[i]--;
atcoder::fenwick_tree<int> fw(2*n+1);
REP(i,k)fw.add(a[i], 1);
REP(i,k)b[a[i]] += 1;
int ans = 0;
REP(i,n){
int l = i;
int r = i+(t-1);
int sm = fw.sum(l,r+1);
if (sm >= 2 && b[i]) {
ans += sm-1;
i = r;
}
}
printf("%d\n", ans);
return 0;
}
Submission Info
Compile Error
Main.cpp: In function ‘int main()’:
Main.cpp:31:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
31 | scanf("%d%d%d",&n,&k,&t);
| ~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:32:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
32 | REP(i,k)scanf("%d",a+i),a[i]--;
| ~~~~~^~~~~~~~~~
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
100 / 100 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt |
| All |
00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 01-n1-001.txt, 01-n1-002.txt, 01-n1-003.txt, 02-hand-001.txt, 10-random-001.txt, 10-random-002.txt, 10-random-003.txt, 10-random-004.txt, 10-random-005.txt, 10-random-006.txt, 10-random-007.txt, 10-random-008.txt, 10-random-009.txt, 10-random-010.txt, 11-random-001.txt, 11-random-002.txt, 11-random-003.txt, 11-random-004.txt, 20-zero-001.txt, 20-zero-002.txt, 20-zero-003.txt, 20-zero-004.txt, 20-zero-005.txt, 30-all-001.txt, 30-all-002.txt, 30-all-003.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 00-sample-001.txt |
AC |
1 ms |
3844 KiB |
| 00-sample-002.txt |
AC |
1 ms |
3704 KiB |
| 00-sample-003.txt |
AC |
1 ms |
3840 KiB |
| 01-n1-001.txt |
AC |
1 ms |
3752 KiB |
| 01-n1-002.txt |
AC |
1 ms |
3832 KiB |
| 01-n1-003.txt |
AC |
10 ms |
4624 KiB |
| 02-hand-001.txt |
AC |
16 ms |
6388 KiB |
| 10-random-001.txt |
AC |
3 ms |
4016 KiB |
| 10-random-002.txt |
AC |
9 ms |
4592 KiB |
| 10-random-003.txt |
AC |
12 ms |
5524 KiB |
| 10-random-004.txt |
AC |
2 ms |
4384 KiB |
| 10-random-005.txt |
AC |
21 ms |
5660 KiB |
| 10-random-006.txt |
AC |
10 ms |
4224 KiB |
| 10-random-007.txt |
AC |
22 ms |
6120 KiB |
| 10-random-008.txt |
AC |
17 ms |
4620 KiB |
| 10-random-009.txt |
AC |
17 ms |
4620 KiB |
| 10-random-010.txt |
AC |
18 ms |
5764 KiB |
| 11-random-001.txt |
AC |
25 ms |
6456 KiB |
| 11-random-002.txt |
AC |
25 ms |
6496 KiB |
| 11-random-003.txt |
AC |
22 ms |
6416 KiB |
| 11-random-004.txt |
AC |
22 ms |
6416 KiB |
| 20-zero-001.txt |
AC |
2 ms |
4028 KiB |
| 20-zero-002.txt |
AC |
3 ms |
4536 KiB |
| 20-zero-003.txt |
AC |
2 ms |
4012 KiB |
| 20-zero-004.txt |
AC |
4 ms |
4972 KiB |
| 20-zero-005.txt |
AC |
2 ms |
4272 KiB |
| 30-all-001.txt |
AC |
25 ms |
6388 KiB |
| 30-all-002.txt |
AC |
22 ms |
6380 KiB |
| 30-all-003.txt |
AC |
22 ms |
6400 KiB |