# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472368 | 2021-09-13T12:27:05 Z | MamdouhN | Zamjena (COCI18_zamjena) | C++14 | 32 ms | 3116 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define endl "\n" map<string,string>idk; main() { int n; cin>>n; string row1[n],row2[n]; for(int i=0;i<n;i++)cin>>row1[i]; for(int i=0;i<n;i++)cin>>row2[i]; for(int i=0;i<n;i++) { bool is_var1 = (row1[i][0]>='a'&&row1[i][0]<='z'); bool is_var2 = (row2[i][0]>='a'&&row2[i][0]<='z'); if(is_var1&&is_var2)continue; if(is_var1) { if(idk[row1[i]]!="") { row1[i]=idk[row1[i]]; continue; } idk[row1[i]]=row2[i]; row1[i]=row2[i]; } if(is_var2) { if(idk[row2[i]]!="") { row2[i]=idk[row2[i]]; continue; } idk[row2[i]]=row1[i]; row2[i]=row1[i]; } } //cout<<"--------------------"<<endl; //for(auto v:row1)cout<<v<<" "; //cout<<endl; //for(auto v:row2)cout<<v<<" "; //cout<<endl; for(int i=0;i<n;i++) { bool is_var1 = (row1[i][0]>='a'&&row1[i][0]<='z'); bool is_var2 = (row2[i][0]>='a'&&row2[i][0]<='z'); if(is_var1&&is_var2) { bool has_value1 = (idk[row1[i]]!=""); bool has_value2 = (idk[row2[i]]!=""); if(has_value1)row1[i]=idk[row1[i]]; else { if(!has_value2) { idk[row1[i]]="1"; row1[i]="1"; } else { idk[row1[i]]=idk[row2[i]]; row1[i]=idk[row2[i]]; } } if(has_value2)row2[i]=idk[row2[i]]; else { if(!has_value1) { idk[row2[i]]="1"; row2[i]="1"; } else { idk[row2[i]]=row1[i]; row2[i]=row1[i]; } } } } //cout<<"--------------------"<<endl; //for(auto v:row1)cout<<v<<" "; //cout<<endl; //for(auto v:row2)cout<<v<<" "; //cout<<endl; bool cando=1; for(int i=0;i<n;i++) { if(row1[i]!=row2[i])cando=0; } cout<<(cando?"DA":"NE")<<endl; } /* 5 x 3 x y 3 x y 2 z 3 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 288 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 288 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 1600 KB | Output is correct |
2 | Incorrect | 32 ms | 3116 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |