Submission #2559827


Source Code Expand


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int R = in.nextInt(), C = in.nextInt(), K = in.nextInt();
			int N = in.nextInt();

			Set<Long> set = new HashSet<>();
			int[] H = new int[R], W = new int[C];
			for (int i = 0; i < N; i++) {
				int r = in.nextInt()-1, c = in.nextInt()-1;
				H[r]++; W[c]++;
				set.add((long)r << 32 | c);
			}

			long ans = 0;
			for (int i = 0; i < R; i++) {
				for (int j = 0; j < C; j++) {
					long wa = H[i] + W[j];
					if (set.contains((long)i << 32 | j)) {
						wa--;
					}
					if (wa == K) {
						ans++;
					}
				}
			}

			out.println(ans);
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}

	}

}

Submission Info

Submission Time
Task C - 収集王
User tutuz
Language Java8 (OpenJDK 1.8.0)
Score 30
Code Size 2637 Byte
Status TLE
Exec Time 2111 ms
Memory 339316 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 18
AC × 23
TLE × 9
MLE × 1
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 71 ms 18900 KB
subtask0-sample02.txt AC 72 ms 21460 KB
subtask0-sample03.txt AC 71 ms 18772 KB
subtask1-01.txt AC 72 ms 19156 KB
subtask1-02.txt AC 72 ms 20692 KB
subtask1-03.txt AC 73 ms 18388 KB
subtask1-04.txt AC 73 ms 21460 KB
subtask1-05.txt AC 72 ms 19284 KB
subtask1-06.txt AC 83 ms 20692 KB
subtask1-07.txt AC 74 ms 19412 KB
subtask1-08.txt AC 75 ms 18900 KB
subtask1-09.txt AC 71 ms 19412 KB
subtask1-10.txt AC 83 ms 21460 KB
subtask1-11.txt AC 83 ms 21204 KB
subtask1-12.txt AC 72 ms 18132 KB
subtask1-13.txt AC 71 ms 18260 KB
subtask1-14.txt AC 74 ms 19540 KB
subtask1-15.txt AC 75 ms 19028 KB
subtask2-01.txt AC 130 ms 28372 KB
subtask2-02.txt AC 170 ms 32504 KB
subtask2-03.txt AC 330 ms 59112 KB
subtask2-04.txt AC 235 ms 49452 KB
subtask2-05.txt MLE 1178 ms 273992 KB
subtask2-06.txt TLE 2109 ms 338004 KB
subtask2-07.txt AC 442 ms 52080 KB
subtask2-08.txt TLE 2106 ms 336112 KB
subtask2-09.txt TLE 2106 ms 336864 KB
subtask2-10.txt TLE 2106 ms 336776 KB
subtask2-11.txt TLE 2110 ms 338132 KB
subtask2-12.txt TLE 2111 ms 336032 KB
subtask2-13.txt TLE 2106 ms 336300 KB
subtask2-14.txt TLE 2110 ms 339316 KB
subtask2-15.txt TLE 2106 ms 337272 KB