Submission #401376
Source Code Expand
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
/**
* vector<int>ar(3);
* for(auto&e:ar){
* scanf("%d",&e);
* }
* sort(ar.begin(),ar.end())
* int sum=accumulate(ar.begin(),ar.end(),0);
***/
int main(){
double pai=3.141592653589;
long a,b,r,c,k,n,tmp;
long long ans=0;
scanf("%ld %ld %ld",&r,&c,&k);
long x[c],y[r],chk[r][c];
for(long i=0;i<r;i++){
y[i]=0;
for(long j=0;j<c;j++){
x[j]=0;
chk[i][j]=0;
}
}
scanf("%ld",&n);
for(long i=0;i<n;i++){
scanf("%ld %ld",&a,&b);
y[a-1]+=1;
x[b-1]+=1;
chk[a-1][b-1]=1;
}
for(long i=0;i<r;i++){
for(long j=0;j<c;j++){
if(chk[i][j]==1){
tmp=x[j]+y[i]-1;
}else{
tmp=x[j]+y[i];
}
if(tmp==k) ans++;
}
}
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 収集王 |
User |
nyon |
Language |
C++11 (GCC 4.9.2) |
Score |
30 |
Code Size |
994 Byte |
Status |
RE |
Exec Time |
290 ms |
Memory |
19620 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:19:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%ld %ld %ld",&r,&c,&k);
^
./Main.cpp:28:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%ld",&n);
^
./Main.cpp:30:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%ld %ld",&a,&b);
^
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
0 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
Subtask1 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt |
Subtask2 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample01.txt |
AC |
26 ms |
676 KB |
subtask0-sample02.txt |
AC |
29 ms |
804 KB |
subtask0-sample03.txt |
AC |
23 ms |
928 KB |
subtask1-01.txt |
AC |
24 ms |
924 KB |
subtask1-02.txt |
AC |
24 ms |
920 KB |
subtask1-03.txt |
AC |
24 ms |
924 KB |
subtask1-04.txt |
AC |
26 ms |
924 KB |
subtask1-05.txt |
AC |
24 ms |
924 KB |
subtask1-06.txt |
AC |
24 ms |
928 KB |
subtask1-07.txt |
AC |
26 ms |
920 KB |
subtask1-08.txt |
AC |
26 ms |
804 KB |
subtask1-09.txt |
AC |
25 ms |
736 KB |
subtask1-10.txt |
AC |
27 ms |
804 KB |
subtask1-11.txt |
AC |
26 ms |
804 KB |
subtask1-12.txt |
AC |
26 ms |
792 KB |
subtask1-13.txt |
AC |
26 ms |
920 KB |
subtask1-14.txt |
AC |
26 ms |
924 KB |
subtask1-15.txt |
AC |
26 ms |
800 KB |
subtask2-01.txt |
AC |
32 ms |
3240 KB |
subtask2-02.txt |
AC |
33 ms |
3620 KB |
subtask2-03.txt |
AC |
78 ms |
19620 KB |
subtask2-04.txt |
AC |
53 ms |
2332 KB |
subtask2-05.txt |
RE |
284 ms |
800 KB |
subtask2-06.txt |
RE |
281 ms |
924 KB |
subtask2-07.txt |
AC |
56 ms |
1708 KB |
subtask2-08.txt |
RE |
288 ms |
732 KB |
subtask2-09.txt |
RE |
282 ms |
796 KB |
subtask2-10.txt |
RE |
289 ms |
924 KB |
subtask2-11.txt |
RE |
288 ms |
804 KB |
subtask2-12.txt |
RE |
290 ms |
796 KB |
subtask2-13.txt |
RE |
282 ms |
796 KB |
subtask2-14.txt |
RE |
290 ms |
920 KB |
subtask2-15.txt |
RE |
290 ms |
924 KB |