Submission #2709872
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int MAXN = 205; int n, m, a[MAXN], cnt[MAXN], b[MAXN]; int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; a[x] = y; memset(cnt, 0, sizeof cnt); memset(b, 0, sizeof b); for (int j = 1; j <= n; j++) cnt[a[j]]++; for (int j = 1; j <= n; j++) { for (int k = 0; k < cnt[j] && j-k >= 1; k++) b[j-k] = 1; } int c = 0; for (int j = 1; j <= n; j++) if (!b[j]) c++; cout << c << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Snuke and Spells |
User | ljt12138 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 625 Byte |
Status | RE |
Exec Time | 98 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | subtask | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 0 / 500 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
subtask | sample1.txt, sample2.txt, sample3.txt, subtask_a1.txt, subtask_a2.txt, subtask_a3.txt, subtask_a4.txt, subtask_a5.txt, subtask_a6.txt, subtask_b1.txt, subtask_b2.txt, subtask_c1.txt, subtask_c2.txt, subtask_d1.txt, subtask_d2.txt, subtask_d3.txt, subtask_d4.txt, subtask_e1.txt, subtask_e2.txt, subtask_e3.txt, subtask_e4.txt, subtask_f1.txt, subtask_f2.txt |
All | sample1.txt, sample2.txt, sample3.txt, a1.txt, a2.txt, a3.txt, a4.txt, a5.txt, a6.txt, b1.txt, b2.txt, c1.txt, c2.txt, d1.txt, d2.txt, d3.txt, d4.txt, e1.txt, e2.txt, e3.txt, e4.txt, f1.txt, f2.txt, sample1.txt, sample2.txt, sample3.txt, subtask_a1.txt, subtask_a2.txt, subtask_a3.txt, subtask_a4.txt, subtask_a5.txt, subtask_a6.txt, subtask_b1.txt, subtask_b2.txt, subtask_c1.txt, subtask_c2.txt, subtask_d1.txt, subtask_d2.txt, subtask_d3.txt, subtask_d4.txt, subtask_e1.txt, subtask_e2.txt, subtask_e3.txt, subtask_e4.txt, subtask_f1.txt, subtask_f2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a1.txt | RE | 96 ms | 256 KB |
a2.txt | RE | 96 ms | 256 KB |
a3.txt | RE | 97 ms | 256 KB |
a4.txt | RE | 96 ms | 256 KB |
a5.txt | RE | 97 ms | 256 KB |
a6.txt | RE | 96 ms | 256 KB |
b1.txt | RE | 97 ms | 256 KB |
b2.txt | RE | 96 ms | 256 KB |
c1.txt | RE | 97 ms | 256 KB |
c2.txt | RE | 97 ms | 256 KB |
d1.txt | RE | 97 ms | 256 KB |
d2.txt | RE | 97 ms | 256 KB |
d3.txt | RE | 96 ms | 256 KB |
d4.txt | RE | 97 ms | 256 KB |
e1.txt | RE | 97 ms | 256 KB |
e2.txt | RE | 96 ms | 256 KB |
e3.txt | RE | 96 ms | 256 KB |
e4.txt | RE | 97 ms | 256 KB |
f1.txt | RE | 97 ms | 256 KB |
f2.txt | RE | 98 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
subtask_a1.txt | AC | 2 ms | 256 KB |
subtask_a2.txt | AC | 2 ms | 256 KB |
subtask_a3.txt | AC | 2 ms | 256 KB |
subtask_a4.txt | AC | 2 ms | 256 KB |
subtask_a5.txt | AC | 2 ms | 256 KB |
subtask_a6.txt | AC | 2 ms | 256 KB |
subtask_b1.txt | AC | 2 ms | 256 KB |
subtask_b2.txt | AC | 2 ms | 256 KB |
subtask_c1.txt | AC | 2 ms | 256 KB |
subtask_c2.txt | AC | 2 ms | 256 KB |
subtask_d1.txt | AC | 2 ms | 256 KB |
subtask_d2.txt | AC | 2 ms | 256 KB |
subtask_d3.txt | AC | 2 ms | 256 KB |
subtask_d4.txt | AC | 2 ms | 256 KB |
subtask_e1.txt | AC | 2 ms | 256 KB |
subtask_e2.txt | AC | 2 ms | 256 KB |
subtask_e3.txt | AC | 2 ms | 256 KB |
subtask_e4.txt | AC | 2 ms | 256 KB |
subtask_f1.txt | AC | 2 ms | 256 KB |
subtask_f2.txt | AC | 2 ms | 256 KB |