Submission #3201901


Source Code Expand

#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>

using namespace std;

typedef long long ll;

int r[100005];
int c[100005];

int ROW[100005];
int COL[100005];

map<int,ll>numR;
map<int,ll>numC;


int main(){

	int R,C,K;

	scanf("%d %d %d",&R,&C,&K);

	int N;

	scanf("%d",&N);

	int i;

	for(i=0;i<N;i++){
	scanf("%d %d",&r[i],&c[i]);
	ROW[r[i]]++;
	COL[c[i]]++;
	}

	ll ans=0ll;

	for(i=1;i<=R;i++){
		numR[ROW[i]]++;
	}

	for(i=1;i<=C;i++){
		numC[COL[i]]++;
	}

	for(i=0;i<=K;i++){
	ans+=numR[i]*numC[K-i];
	}

	for(i=0;i<N;i++){
		if(ROW[r[i]]+COL[c[i]]==K){ans-=1ll;}
		if(ROW[r[i]]+COL[c[i]]==K+1){ans+=1ll;}
	}

	printf("%lld\n",ans);

	return 0;
}

Submission Info

Submission Time
Task C - 収集王
User tekitouk
Language C++14 (GCC 5.4.1)
Score 100
Code Size 779 Byte
Status AC
Exec Time 106 ms
Memory 14336 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&R,&C,&K);
                            ^
./Main.cpp:30:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
                ^
./Main.cpp:35:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&r[i],&c[i]);
                            ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 18
AC × 33
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 1 ms 256 KB
subtask0-sample02.txt AC 1 ms 256 KB
subtask0-sample03.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 256 KB
subtask1-06.txt AC 1 ms 256 KB
subtask1-07.txt AC 1 ms 256 KB
subtask1-08.txt AC 1 ms 256 KB
subtask1-09.txt AC 1 ms 256 KB
subtask1-10.txt AC 1 ms 256 KB
subtask1-11.txt AC 1 ms 256 KB
subtask1-12.txt AC 1 ms 256 KB
subtask1-13.txt AC 1 ms 256 KB
subtask1-14.txt AC 1 ms 256 KB
subtask1-15.txt AC 1 ms 256 KB
subtask2-01.txt AC 1 ms 256 KB
subtask2-02.txt AC 2 ms 256 KB
subtask2-03.txt AC 6 ms 512 KB
subtask2-04.txt AC 105 ms 13952 KB
subtask2-05.txt AC 19 ms 1408 KB
subtask2-06.txt AC 21 ms 1792 KB
subtask2-07.txt AC 16 ms 1152 KB
subtask2-08.txt AC 21 ms 1792 KB
subtask2-09.txt AC 21 ms 1792 KB
subtask2-10.txt AC 21 ms 1792 KB
subtask2-11.txt AC 21 ms 1792 KB
subtask2-12.txt AC 21 ms 1792 KB
subtask2-13.txt AC 106 ms 14336 KB
subtask2-14.txt AC 22 ms 1792 KB
subtask2-15.txt AC 21 ms 1792 KB