Submission #401368
Source Code Expand
//#include "inspect.hpp"
#include <vector>
#include <map>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
int R,C,K,N;
scanf("%d%d%d%d",&R,&C,&K,&N);
if(C>1000)return 1;
vector<int>vr(R),vc(C);
vector<vector<int> >candy(R);
for(int i=0;i<N;i++){
int r,c;
scanf("%d%d",&r,&c),r--,c--;
vr[r]++,vc[c]++;
candy[r].push_back(c);
}
long long r=0;
map<int,int>mc;
for(auto &e:vc)mc[e]++;
for(int i=0;i<R;i++)for(int j=0;j<C;j++)r+=vr[i]+vc[j]==K+(find(candy[i].begin(),candy[i].end(),j)!=candy[i].end());
// r+=mc[K-vr[i]];
// for(auto &e:candy[i])r+=vc[e]+vr[i]==K+1;
//}
printf("%lld\n",r);
}
Submission Info
Submission Time
2015-05-09 21:56:54+0900
Task
C - 収集王
User
leafmoon
Language
C++11 (GCC 4.9.2)
Score
30
Code Size
662 Byte
Status
RE
Exec Time
77 ms
Memory
1496 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:10:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d",&R,&C,&K,&N);
^
./Main.cpp:16:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&r,&c),r--,c--;
^
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
23 ms
796 KB
subtask0-sample02.txt
AC
25 ms
672 KB
subtask0-sample03.txt
AC
25 ms
716 KB
subtask1-01.txt
AC
25 ms
800 KB
subtask1-02.txt
AC
24 ms
800 KB
subtask1-03.txt
AC
24 ms
796 KB
subtask1-04.txt
AC
24 ms
796 KB
subtask1-05.txt
AC
23 ms
804 KB
subtask1-06.txt
AC
23 ms
796 KB
subtask1-07.txt
AC
23 ms
800 KB
subtask1-08.txt
AC
26 ms
796 KB
subtask1-09.txt
AC
25 ms
736 KB
subtask1-10.txt
AC
23 ms
920 KB
subtask1-11.txt
AC
24 ms
736 KB
subtask1-12.txt
AC
25 ms
800 KB
subtask1-13.txt
AC
24 ms
800 KB
subtask1-14.txt
AC
26 ms
800 KB
subtask1-15.txt
AC
26 ms
796 KB
subtask2-01.txt
AC
30 ms
764 KB
subtask2-02.txt
AC
29 ms
800 KB
subtask2-03.txt
RE
24 ms
796 KB
subtask2-04.txt
RE
25 ms
800 KB
subtask2-05.txt
RE
24 ms
796 KB
subtask2-06.txt
RE
26 ms
664 KB
subtask2-07.txt
AC
77 ms
1496 KB
subtask2-08.txt
RE
25 ms
792 KB
subtask2-09.txt
RE
24 ms
672 KB
subtask2-10.txt
RE
25 ms
784 KB
subtask2-11.txt
RE
26 ms
800 KB
subtask2-12.txt
RE
25 ms
796 KB
subtask2-13.txt
RE
27 ms
728 KB
subtask2-14.txt
RE
25 ms
672 KB
subtask2-15.txt
RE
24 ms
792 KB