# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702139 | chenyan | Zamjena (COCI18_zamjena) | C++17 | 84 ms | 7968 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;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb emplace_back
#define N 50010
map<string,int>m;
int a[2][N],cnt;
bitset<N>vis;
vector<int>g[N];
void dfs(int v){
vis[v]=1;
if(v<=1000)cnt++;
for(int u:g[v]){
if(vis[u])continue;
dfs(u);
}
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,k,i,j,t=0,u,v;
string s;
cin>>n;
for(u=0;u<2;u++){
for(i=0;i<n;i++){
cin>>s;
int x=0;
if(s[0]>='0'&&s[0]<='9'){
for(j=1,k=0;k<s.size();j*=10,k++)
x+=(s[s.size()-1-k]-'0')*j;
a[u][i]=x;
}
else{
if(!m[s])m[s]=(++t)+1000;
a[u][i]=m[s];
}
}
}
for(i=0;i<n;i++)g[a[0][i]].pb(a[1][i]),g[a[1][i]].pb(a[0][i]);
for(i=1;i<=1000;i++){
cnt=0;
dfs(i);
if(cnt>1){
cout<<"NE\n";
return 0;
}
}
cout<<"DA\n";
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |