# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
643736 | 2022-09-22T19:51:33 Z | mychecksedad | Kemija (COCI22_kemija) | C++17 | 3 ms | 468 KB |
/* Author : Mychecksdead */ #include<bits/stdc++.h> using namespace std; typedef long long int ll; typedef long double ld; #define MOD (1000000000+7) #define MOD1 (998244353) #define PI 3.1415926535 #define pb push_back #define setp() cout << setprecision(15) #define all(x) x.begin(), x.end() #define debug(x) cerr << #x << " is " << x << '\n'; const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20; string s; void solve(){ cin >> s; multiset<char> a, b; bool side = 0; bool ne = 1; int c = 1; for(int i = 0; i < s.length(); ++i){ if(s[i] == '-') side = 1, ne = 1, c = 1; if(s[i] == '-' || s[i] == '>') continue; if(s[i] == '+') { ne = 1, c = 1; continue; } if(s[i] >= '0' && s[i] <= '9'){ if(ne){ c = s[i] - '0'; ne = 0; }else{ for(int j=0;j<c;++j) for(char k = s[i] - 1; k > '0'; --k) if(side) b.insert(s[i - 1]); else a.insert(s[i - 1]); } }else{ ne = 0; for(int j=0;j<c;++j) if(side) b.insert(s[i]); else a.insert(s[i]); } } for(char c: a){ if(b.count(c) != a.count(c)){ cout << "NE"; return; } } cout << "DA"; } int main(){ cin.tie(0); ios::sync_with_stdio(0); int T = 1, aa; cin >> T;aa=T; while(T--){ // cout << "Case #" << aa-T << ": "; solve(); cout << '\n'; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Incorrect | 1 ms | 340 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 468 KB | Output is correct |
2 | Correct | 1 ms | 324 KB | Output is correct |
3 | Incorrect | 3 ms | 468 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Incorrect | 1 ms | 340 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |