Submission #20825

# Submission time Handle Problem Language Result Execution time Memory
20825 2017-02-20T13:39:36 Z model_code None (KOI16_room) C++11
100 / 100
0 ms 1116 KB
#include <stdio.h>

int n,k;

int cnt[7][2];

int main()
{
scanf("%d %d", &n,&k);
for (int i = 1; i <= n; i++) {
int gender, year;
scanf("%d %d", &gender, &year);
cnt[year][gender]++;

}

int ans = 0;

for (int i = 3; i <= 5; i += 2) {
for (int j = 0; j <= 1; j++) {
ans += (cnt[i][j] + cnt[i + 1][j] + k - 1) / k;
}
}

ans += (cnt[1][0] + cnt[1][1] + cnt[2][0] + cnt[2][1] + k - 1) / k;
printf("%d", ans);

return 0;
} 

Compilation message

room.cpp: In function 'int main()':
room.cpp:9:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 scanf("%d %d", &n,&k);
                      ^
room.cpp:12:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 scanf("%d %d", &gender, &year);
                               ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 0 ms 1116 KB Output is correct
11 Correct 0 ms 1116 KB Output is correct
12 Correct 0 ms 1116 KB Output is correct
13 Correct 0 ms 1116 KB Output is correct
14 Correct 0 ms 1116 KB Output is correct
15 Correct 0 ms 1116 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 0 ms 1116 KB Output is correct
11 Correct 0 ms 1116 KB Output is correct
12 Correct 0 ms 1116 KB Output is correct
13 Correct 0 ms 1116 KB Output is correct
14 Correct 0 ms 1116 KB Output is correct
15 Correct 0 ms 1116 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
17 Correct 0 ms 1116 KB Output is correct
18 Correct 0 ms 1116 KB Output is correct
19 Correct 0 ms 1116 KB Output is correct
20 Correct 0 ms 1116 KB Output is correct
21 Correct 0 ms 1116 KB Output is correct
22 Correct 0 ms 1116 KB Output is correct
23 Correct 0 ms 1116 KB Output is correct
24 Correct 0 ms 1116 KB Output is correct
25 Correct 0 ms 1116 KB Output is correct
26 Correct 0 ms 1116 KB Output is correct
27 Correct 0 ms 1116 KB Output is correct
28 Correct 0 ms 1116 KB Output is correct
29 Correct 0 ms 1116 KB Output is correct
30 Correct 0 ms 1116 KB Output is correct
31 Correct 0 ms 1116 KB Output is correct
32 Correct 0 ms 1116 KB Output is correct
33 Correct 0 ms 1116 KB Output is correct
34 Correct 0 ms 1116 KB Output is correct
35 Correct 0 ms 1116 KB Output is correct
36 Correct 0 ms 1116 KB Output is correct
37 Correct 0 ms 1116 KB Output is correct
38 Correct 0 ms 1116 KB Output is correct
39 Correct 0 ms 1116 KB Output is correct
40 Correct 0 ms 1116 KB Output is correct
41 Correct 0 ms 1116 KB Output is correct
42 Correct 0 ms 1116 KB Output is correct