# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874961 | HossamHero7 | Kemija (COCI22_kemija) | C++14 | 1 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
vector<int> solveEq(string s){
int coef = 1;
int st = 0;
if(isdigit(s[0])) coef = s[0] - '0' , st = 1;
vector<int> frq(26);
for(int i=st;i<s.size();i++){
if(i+1<s.size() && isdigit(s[i+1])) frq[s[i]-'A'] += coef * (s[i+1]-48) , i++;
else frq[s[i]-'A'] += coef;
}
return frq;
}
void solve(){
string s;
cin>>s;
string s1 = "";
string s2 = "";
bool b = 0;
for(auto i : s){
if(i == '>') b = 1;
if(i == '-' || i =='>') continue;
if(!b) s1 += i;
else s2 += i;
}
vector<int> frq1(26) , frq2(26);
string tmp = "";
for(auto i : s1){
if(i == '+'){
vector<int> f = solveEq(tmp);
for(int j=0;j<26;j++) frq1[j] += f[j];
tmp = "";
continue;
}
tmp += i;
}
vector<int> f = solveEq(tmp);
for(int j=0;j<26;j++) frq1[j] += f[j];
tmp = "";
for(auto i : s2){
if(i == '+'){
vector<int> f = solveEq(tmp);
for(int j=0;j<26;j++) frq2[j] += f[j];
tmp = "";
continue;
}
tmp += i;
}
f = solveEq(tmp);
for(int j=0;j<26;j++) frq2[j] += f[j];
cout<<(frq1 == frq2 ? "DA" : "NE")<<endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |