Submission #74604122
Source Code Expand
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
@SuppressWarnings("DuplicatedCode")
public class Main {
static int MAX_STRING_LENGTH = (int) 1e6; // 字符串最大长度
static int MAX_DIGIT_LENGTH = (int) 1e6; // 数位最大长度
static int MOD7 = (int) 1e9 + 7, MOD8 = 80112002, MOD9 = 998244353, inf = Integer.MAX_VALUE;
/***** 检查 T *****/
static class Solution {
void solve() {
int n = io.nextInt(), m = io.nextInt(), t = io.nextInt();
Map<Integer, Integer> sum = new HashMap<>();
int[] cnt = new int[n + 1];
for (int i = 0; i < m; i++) {
int id = io.nextInt(), c = io.nextInt();
sum.merge(id, c, Integer::sum);
cnt[id]++;
}
int ans = 0;
for (Map.Entry<Integer, Integer> e : sum.entrySet()) {
int id = e.getKey(), s = e.getValue();
if (s < t * cnt[id]) ans++;
}
io.println(ans);
}
static class Fenwick {
int[] tree;
int n;
Fenwick(int n) {
tree = new int[n + 1];
this.n = n + 1;
}
void add(int i, int v) {
for (i++; i < n; i += i & -i) {
tree[i] += v;
}
}
int query(int l, int r) {
return pre(r) - pre(l - 1);
}
int pre(int i) {
int s = 0;
for (i++; i > 0; i &= i - 1) {
s += tree[i];
}
return s;
}
}
}
public static void main(String[] args) {
io = new IO();
int T = 1;
// T = io.nextInt();
for (; T > 0; T--) {
new Solution().solve();
}
io.close();
}
static IO io;
static class IO {
BufferedInputStream bis = new BufferedInputStream(System.in);
PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));
int nextInt() {
return (int) nextLong();
}
long nextLong() {
try {
long sign = 1, x = 0;
int c = bis.read();
while (c < '0' || c > '9') {
if (c == '-') sign = -1;
c = bis.read();
}
while (c >= '0' && c <= '9') {
x = x * 10 + (c - '0');
c = bis.read();
}
return sign * x;
} catch (IOException e) {
throw new RuntimeException(e.getMessage());
}
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
try {
int sign = 1, x = 0;
int c = bis.read();
while (c < '0' || c > '9') {
if (c == '-') sign = -1;
c = bis.read();
}
while (c >= '0' && c <= '9') {
x = x * 10 + (c - '0');
c = bis.read();
}
a[i] = sign * x;
} catch (IOException e) {
throw new RuntimeException(e.getMessage());
}
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
try {
long sign = 1, x = 0;
int c = bis.read();
while (c < '0' || c > '9') {
if (c == '-') sign = -1;
c = bis.read();
}
while (c >= '0' && c <= '9') {
x = x * 10 + (c - '0');
c = bis.read();
}
a[i] = sign * x;
} catch (IOException e) {
throw new RuntimeException(e.getMessage());
}
}
return a;
}
int[] nextDigitArray(int n) {
try {
int[] a = new int[n];
int x = bis.read();
while (ignore(x)) {
x = bis.read();
}
int i = 0;
while (!ignore(x)) {
a[i++] = x - '0';
x = bis.read();
}
return a;
} catch (Exception e) {
throw new RuntimeException(e.getMessage());
}
}
private int[] DIGIT_ARRAY;
int[] nextDigitArray() {
try {
if (DIGIT_ARRAY == null) {
DIGIT_ARRAY = new int[MAX_DIGIT_LENGTH];
}
int x = bis.read();
while (ignore(x)) {
x = bis.read();
}
int m = 0;
while (!ignore(x)) {
DIGIT_ARRAY[m++] = x - '0';
x = bis.read();
}
int[] a = new int[m];
System.arraycopy(DIGIT_ARRAY, 0, a, 0, m);
return a;
} catch (Exception e) {
throw new RuntimeException(e.getMessage());
}
}
char nextChar() {
try {
int x = bis.read();
while (ignore(x)) {
x = bis.read();
}
return (char) x;
} catch (Exception e) {
throw new RuntimeException(e.getMessage());
}
}
String[] nextStringArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++) {
try {
if (CHAR_ARRAY == null) {
CHAR_ARRAY = new char[MAX_STRING_LENGTH];
}
int x = bis.read();
while (ignore(x)) {
x = bis.read();
}
int m = 0;
while (x != ' ' && x != ',' && !ignore(x)) {
CHAR_ARRAY[m++] = (char) x;
x = bis.read();
}
a[i] = new String(CHAR_ARRAY, 0, m);
} catch (IOException e) {
throw new RuntimeException(e.getMessage());
}
}
return a;
}
private char[] CHAR_ARRAY;
char[] nextCharArray(boolean line) {
try {
if (CHAR_ARRAY == null) {
CHAR_ARRAY = new char[MAX_STRING_LENGTH];
}
int x = bis.read();
while (ignore(x)) {
x = bis.read();
}
int m = 0;
while (line ? (x == ' ' || x == ',' || !ignore(x)) : !ignore(x)) {
CHAR_ARRAY[m++] = (char) x;
x = bis.read();
}
char[] a = new char[m];
System.arraycopy(CHAR_ARRAY, 0, a, 0, m);
return a;
} catch (Exception e) {
throw new RuntimeException(e.getMessage());
}
}
char[] nextCharArray(int n) {
try {
char[] a = new char[n];
int x = bis.read();
while (ignore(x)) {
x = bis.read();
}
int i = 0;
while (!ignore(x)) {
a[i++] = (char) x;
x = bis.read();
}
return a;
} catch (Exception e) {
throw new RuntimeException(e.getMessage());
}
}
private boolean ignore(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
String nextString(boolean line) {
return new String(nextCharArray(line));
}
String nextString() {
return nextString(false);
}
boolean nextBoolean() {
return "true".equalsIgnoreCase(nextString());
}
double nextDouble() {
return Double.parseDouble(nextString());
}
void println(Object obj) {
print(obj);
print("\n");
}
void println() {
print('\n');
}
void print(Object obj) {
pw.print(obj);
}
void printf(String format, Object... obj) {
pw.printf(format, obj);
}
void close() {
try {
if (bis != null) bis.close();
if (pw != null) {
pw.flush();
pw.close();
}
bis = null;
pw = null;
} catch (Exception ignore) {
}
}
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Student Grade Management |
| User | gaoyuliang |
| Language | Java24 (OpenJDK 24.0.2) |
| Score | 300 |
| Code Size | 9605 Byte |
| Status | AC |
| Exec Time | 143 ms |
| Memory | 47732 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample01.txt, sample02.txt, sample03.txt |
| All | sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt, in76.txt, in77.txt, in78.txt, in79.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| in01.txt | AC | 53 ms | 38900 KiB |
| in02.txt | AC | 50 ms | 38596 KiB |
| in03.txt | AC | 50 ms | 38704 KiB |
| in04.txt | AC | 50 ms | 38708 KiB |
| in05.txt | AC | 49 ms | 38616 KiB |
| in06.txt | AC | 49 ms | 38600 KiB |
| in07.txt | AC | 49 ms | 38884 KiB |
| in08.txt | AC | 87 ms | 41956 KiB |
| in09.txt | AC | 133 ms | 46016 KiB |
| in10.txt | AC | 132 ms | 45520 KiB |
| in11.txt | AC | 125 ms | 45624 KiB |
| in12.txt | AC | 129 ms | 45736 KiB |
| in13.txt | AC | 128 ms | 45492 KiB |
| in14.txt | AC | 122 ms | 47684 KiB |
| in15.txt | AC | 125 ms | 46012 KiB |
| in16.txt | AC | 88 ms | 41664 KiB |
| in17.txt | AC | 126 ms | 47192 KiB |
| in18.txt | AC | 50 ms | 39120 KiB |
| in19.txt | AC | 82 ms | 40324 KiB |
| in20.txt | AC | 115 ms | 47460 KiB |
| in21.txt | AC | 89 ms | 42372 KiB |
| in22.txt | AC | 136 ms | 45612 KiB |
| in23.txt | AC | 143 ms | 45492 KiB |
| in24.txt | AC | 125 ms | 47088 KiB |
| in25.txt | AC | 125 ms | 47556 KiB |
| in26.txt | AC | 133 ms | 45648 KiB |
| in27.txt | AC | 127 ms | 45780 KiB |
| in28.txt | AC | 122 ms | 47732 KiB |
| in29.txt | AC | 119 ms | 45380 KiB |
| in30.txt | AC | 50 ms | 38264 KiB |
| in31.txt | AC | 126 ms | 45508 KiB |
| in32.txt | AC | 50 ms | 38680 KiB |
| in33.txt | AC | 49 ms | 38864 KiB |
| in34.txt | AC | 50 ms | 38852 KiB |
| in35.txt | AC | 48 ms | 39012 KiB |
| in36.txt | AC | 49 ms | 38764 KiB |
| in37.txt | AC | 48 ms | 38512 KiB |
| in38.txt | AC | 49 ms | 38972 KiB |
| in39.txt | AC | 49 ms | 38980 KiB |
| in40.txt | AC | 86 ms | 41764 KiB |
| in41.txt | AC | 88 ms | 42180 KiB |
| in42.txt | AC | 49 ms | 38264 KiB |
| in43.txt | AC | 53 ms | 38960 KiB |
| in44.txt | AC | 50 ms | 38652 KiB |
| in45.txt | AC | 48 ms | 38936 KiB |
| in46.txt | AC | 48 ms | 38532 KiB |
| in47.txt | AC | 50 ms | 38612 KiB |
| in48.txt | AC | 48 ms | 38856 KiB |
| in49.txt | AC | 48 ms | 38780 KiB |
| in50.txt | AC | 129 ms | 47680 KiB |
| in51.txt | AC | 122 ms | 45552 KiB |
| in52.txt | AC | 85 ms | 42340 KiB |
| in53.txt | AC | 118 ms | 45812 KiB |
| in54.txt | AC | 85 ms | 42356 KiB |
| in55.txt | AC | 127 ms | 45388 KiB |
| in56.txt | AC | 93 ms | 43196 KiB |
| in57.txt | AC | 87 ms | 41780 KiB |
| in58.txt | AC | 83 ms | 42076 KiB |
| in59.txt | AC | 120 ms | 45532 KiB |
| in60.txt | AC | 47 ms | 38984 KiB |
| in61.txt | AC | 47 ms | 38600 KiB |
| in62.txt | AC | 46 ms | 38504 KiB |
| in63.txt | AC | 47 ms | 38928 KiB |
| in64.txt | AC | 46 ms | 38676 KiB |
| in65.txt | AC | 47 ms | 38696 KiB |
| in66.txt | AC | 47 ms | 38608 KiB |
| in67.txt | AC | 46 ms | 38520 KiB |
| in68.txt | AC | 46 ms | 38604 KiB |
| in69.txt | AC | 45 ms | 38608 KiB |
| in70.txt | AC | 45 ms | 38848 KiB |
| in71.txt | AC | 46 ms | 38708 KiB |
| in72.txt | AC | 44 ms | 38728 KiB |
| in73.txt | AC | 46 ms | 38524 KiB |
| in74.txt | AC | 45 ms | 38284 KiB |
| in75.txt | AC | 45 ms | 38700 KiB |
| in76.txt | AC | 46 ms | 38624 KiB |
| in77.txt | AC | 46 ms | 38800 KiB |
| in78.txt | AC | 45 ms | 38572 KiB |
| in79.txt | AC | 125 ms | 45476 KiB |
| sample01.txt | AC | 47 ms | 38620 KiB |
| sample02.txt | AC | 47 ms | 38932 KiB |
| sample03.txt | AC | 47 ms | 38840 KiB |