Submission #83168

#TimeUsernameProblemLanguageResultExecution timeMemory
83168fredbrPictionary (COCI18_pictionary)C++17
56 / 140
1587 ms3544 KiB
#include <bits/stdc++.h> using namespace std; using ii = pair<int, int>; template <int maxn> struct Dsu { int n; int pai[maxn], w[maxn]; int find(int x) { if (x == pai[x]) return x; return pai[x] = find(pai[x]); } bool find(int a, int b) { a = find(a), b= find(b); return a == b; } void join(int a, int b) { a = find(a), b = find(b); if (w[a] < w[b]) swap(a, b); pai[b] = a; w[a] += w[b]; } void init(int n_) { n = n_; fill(w+1, w+n+1, 1); iota(pai+1, pai+n+1, 1); } }; int const maxn = 101010; struct Query { int ff, ss, id; }; Dsu<maxn> dsu; Query qr[maxn]; bool vis[maxn]; int res[maxn]; int main() { ios::sync_with_stdio(false), cin.tie(0); int n, m; int q; cin >> n >> m >> q; for (int i = 0; i < q; i++) { cin >> qr[i].ff >> qr[i].ss; qr[i].id = i; } dsu.init(n); bool ok = false; for (int k = m; k >= 1; k--) { for (int i = k*2; i <= n; i += k) { if (!dsu.find(k, i)) dsu.join(k, i); } for (int i = 0; i < q; i++) { if (!vis[i] and dsu.find(qr[i].ff, qr[i].ss)) { vis[i] = true; res[i] = m-k+1; } } } for (int i = 0; i < q; i++) cout << res[i] << "\n"; }

Compilation message (stderr)

pictionary.cpp: In function 'int main()':
pictionary.cpp:68:10: warning: unused variable 'ok' [-Wunused-variable]
     bool ok = false;
          ^~
#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...
#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...