# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627584 | Farhan_HY | Zamjena (COCI18_zamjena) | C++14 | 62 ms | 65536 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>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
/// Benzema is the best player in the world
const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int LOG = 31;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
string a[N], b[N];
int n;
map<string, bool> vis;
map<string, vector<string>> adj;
int x = -1;
bool dfs(string node)
{
vis[node] = 1;
bool ret = 1;
if (node[0] >= '0' && node[0] <= '9')
{
int num = 0;
for(auto i: node)
num *= 10, num += x - '0';
if (x == -1)
x = num;
ret &= num == x;
}
for(auto y: adj[node])
if (!vis[y]) ret &= dfs(y);
return ret;
}
main()
{
IOS
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) cin >> b[i];
for(int i = 1; i <= n; i++) adj[a[i]].pb(b[i]), adj[b[i]].pb(a[i]);
bool ok = 1;
for(auto y: adj)
{
if (vis[y.F]) continue;
x = -1;
ok &= dfs(y.F);
}
if (ok) cout << "DA";
else cout << "NE";
}
///use scanf
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... |