# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1013670 | 2024-07-03T19:20:27 Z | Saladd | Zamjena (COCI18_zamjena) | C++14 | 17 ms | 1624 KB |
#include <bits/stdc++.h> using namespace std; map <string,int> mp; int pa[1000000],arr[1000000],arr2[1000000],st[100000]; int root(int x) { if(pa[x]==x) return x; else return pa[x] = root(pa[x]); } int main() { cin.tie(0)->sync_with_stdio(0); int n; int idx=1; cin >> n; for (int i=1;i<=n;i++){ string str; int cnt=0; cin >> str; int len = str.size(); //cout << mp[str] << " ----\n"; if(mp[str]>0){ arr[i]=mp[str]; continue; } for (int j=0;j<len,cnt==0;j++){ //cout << str[j] << "\n"; if(isalpha(str[j])){ arr[i]=idx; pa[idx]=idx; mp[str]=idx; st[idx++]=1; cnt=1; } else{ arr[i]=idx; pa[idx]=idx; mp[str]=idx; st[idx++]=0; cnt=1; } } } for (int i=1;i<=n;i++){ string str; int cnt=0; cin >> str; int len = str.size(); if(mp[str]>0){ arr2[i]=mp[str]; continue; } for (int j=0;j<len,cnt==0;j++){ if(isalpha(str[j])){ arr2[i]=idx; pa[idx]=idx; mp[str]=idx; st[idx++]=1; cnt=1; } else{ arr2[i]=idx; pa[idx]=idx; mp[str]=idx; st[idx++]=0; cnt=1; } } } for(int i=1;i<=n;i++){ int a=arr[i]; int b=arr2[i]; if(root(a)!=root(b) && st[b]==1){ pa[root(b)]=root(a); st[b]=0; } if(root(a)!=root(b) && st[b]==0){ cout << "NE"; return 0; } } cout << "DA"; return 0; } /* 4 4 5 iks ipasdasd 1 iks 3 iks 3 5 iks ipasdasd iks 3 iks */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 856 KB | Output is correct |
2 | Incorrect | 17 ms | 1624 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |