oj.uz

Submission #882482

# Submission time Handle Problem Language Result Execution time Memory
882482 2023-12-03T08:56:07 Z Ahmed_Solyman Kemija (COCI22_kemija) C++14
50 / 50
 1 ms 500 KB 
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"DA":"NE")<<endl;
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #ifndef ONLINE_JUDGE
  //  freopen("input.in", "r", stdin);
  //  freopen("output.out", "w", stdout);
    #endif
    fast
    int t;cin>>t;
    while(t--){
        string s;cin>>s;
        string a="",b="";
        bool flag=0;
        for(int i=0;i<(int)s.size();i++){
            if(i<(int)s.size()-1){
                if(s.substr(i,2)=="->"){
                    flag=1;
                    i++;
                    continue;
                }
            }
            if(!flag)a+=s[i];
            else b+=s[i];
        }
        a+="+";b+="+";
        vector<int>f1(26),f2(26);
        auto solve=[&](string g,bool f){
            string p="";
            for(char c:g){
                if(c=='+'){
                    int n=p.size();
                    int factor=1;
                    if(p[0]>='1' && p[0]<='9'){
                        factor=p[0]-'1'+1;
                    }
                    for(int i=(factor==1?0:1);i<n;i++){
                        int h=1;
                        if(i<n-1 && p[i+1]>='1' && p[i+1]<='9'){
                            h=p[i+1]-'1'+1;
                        }
                        if(!f){
                            f1[p[i]-'A']+=h*factor;
                        }
                        else{
                            f2[p[i]-'A']+=h*factor;
                        }
                        if(h!=1){
                            i++;
                        }
                    }
                    p="";
                    continue;
                }
                p+=c;
            }
        };
        solve(a,0);solve(b,1);
        bool valid=1;
        for(int i=0;i<26;i++){
            valid&=(f1[i]==f2[i]);
        }
        person_bool(valid);
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 448 KB Output is correct
2 Correct 0 ms 500 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 448 KB Output is correct
2 Correct 0 ms 500 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 0 ms 348 KB Output is correct