# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799478 | 2023-07-31T14:58:16 Z | tlnk07 | Kemija (COCI22_kemija) | C++17 | 1 ms | 304 KB |
#include<bits/stdc++.h> using namespace std; long long n, nho, cnt[101], chk, pos; string s; int main() { cin >> n; memset(cnt, 0, sizeof(cnt)); while(n--) { nho = 1; chk = 0; cin >> s; for(int i = 0; i < s.size(); ++i) { if(chk == 0 && s[i] >= '0' && s[i] <= '9') { nho = s[i] - '0'; chk = true; } else if(s[i] >= '0' && s[i] <= '9') cnt[s[i - 1] - 'A'] += ((s[i] - '1') * nho); else if(s[i] >= 'A' && s[i] <= 'Z') { cnt[s[i] - 'A'] += nho; chk = 1; } else if(s[i] == '+') chk = 0; else if(s[i] == '-' && s[i + 1] == '>') { pos = i + 2; break; } } chk = 0; nho = 1; for(int i = pos; i < s.size(); ++i) { if(chk == 0 && s[i] >= '0' && s[i] <= '9') { nho = s[i] - '0'; chk = true; } else if(s[i] >= '0' && s[i] <= '9') cnt[s[i - 1] - 'A'] -= (s[i] - '1') * nho; else if(s[i] >= 'A' && s[i] <= 'Z') { cnt[s[i] - 'A'] -= nho; chk = 1; } else if(s[i] == '+') chk = 0; } chk = 0; for(int i = 0; i < 26; ++i) { if(cnt[i]) { chk = true; } cnt[i] = 0; } if(chk) cout << "NE\n"; else cout << "DA\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 304 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 300 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 304 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 1 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 0 ms | 212 KB | Output is correct |
17 | Correct | 1 ms | 300 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |
19 | Correct | 0 ms | 212 KB | Output is correct |
20 | Correct | 1 ms | 212 KB | Output is correct |
21 | Correct | 0 ms | 300 KB | Output is correct |
22 | Incorrect | 0 ms | 212 KB | Output isn't correct |
23 | Halted | 0 ms | 0 KB | - |