# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778983 | 2023-07-11T06:07:19 Z | vjudge1 | Zamjena (COCI18_zamjena) | C++17 | 1000 ms | 3724 KB |
#include<bits/stdc++.h> using namespace std; #define lalala ios_base::sync_with_stdio(false);cin.tie(NULL); #define endl "\n" #define int long long int #define pb push_back #define N 105 map<string,string> mp; signed main(){ lalala; int n;cin>>n; vector<string> bir, iki; for(int i=0;i<n;i++){ string str;cin>>str; bir.pb(str); mp[str]="&&"; } int yes=1; for(int i=0;i<n;i++){ string str;cin>>str; mp[str]="&&"; iki.pb(str); int yes1=1,yes2=1; string a,b; for(int j=0;j<str.length();j++){ if(iki[i][j]-'0'>9){ yes1=0;break; } a.pb(iki[i][j]); } for(int j=0;j<bir[i].length();j++){ if(bir[i][j]-'0'>9){ yes2=0;break; } b.pb(bir[i][j]); } //cout<<a<<" "<<b<<endl; if(yes1){ if(yes2){ if(iki[i]==bir[i])continue; yes=0;continue; } if(mp[bir[i]]=="&&"){ mp[bir[i]]=iki[i]; continue; } if(mp[bir[i]]!=iki[i])yes=0; continue; } if(yes2){ if(mp[iki[i]]==bir[i])continue; if(mp[iki[i]]=="&&"){ mp[iki[i]]=bir[i];continue; } yes=0;continue; } if(mp[iki[i]]=="&&")mp[iki[i]]=mp[bir[i]]; if(mp[bir[i]]=="&&")mp[bir[i]]=mp[iki[i]]; if(mp[iki[i]]!=mp[bir[i]])yes=0; } int uwu=1000; while(uwu--){ for(int i=0;i<n;i++){ if(mp[iki[i]]=="&&")mp[iki[i]]=mp[bir[i]]; if(mp[bir[i]]=="&&")mp[bir[i]]=mp[iki[i]]; if(mp[bir[i]]==mp[iki[i]])continue; yes=0; } if(yes==0)break; } if(yes)cout<<"DA"<<endl; else cout<<"NE"<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 2 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 | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 212 KB | Output is correct |
2 | Correct | 5 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 5 ms | 212 KB | Output is correct |
6 | Incorrect | 2 ms | 212 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 359 ms | 468 KB | Output is correct |
2 | Correct | 477 ms | 444 KB | Output is correct |
3 | Correct | 9 ms | 724 KB | Output is correct |
4 | Correct | 10 ms | 772 KB | Output is correct |
5 | Execution timed out | 1077 ms | 852 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 1868 KB | Output is correct |
2 | Execution timed out | 1081 ms | 3724 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |