Submission #627588

#TimeUsernameProblemLanguageResultExecution timeMemory
627588Farhan_HYZamjena (COCI18_zamjena)C++14
56 / 70
44 ms65536 KiB
#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.size() == 0) return 1; if (node[0] >= '0' && node[0] <= '9') { int num = 0; for(auto i: node) num *= 10, num += i - '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)

zamjena.cpp:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main()
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...