Submission #201655

#TimeUsernameProblemLanguageResultExecution timeMemory
201655SamAndZamjene (COCI16_zamjene)C++17
56 / 140
6065 ms65476 KiB
#include <bits/stdc++.h> using namespace std; #define m_p make_pair const int N = 1000006; const int P = 1000003; const int M = 1000000007; const int P1 = 2000003; const int M1 = 1000000009; int ast[N], ast1[N]; void pre() { ast[0] = 1; ast1[0] = 1; for (int i = 1; i < N; ++i) { ast[i] = (ast[i - 1] * 1LL * P) % M; ast1[i] = (ast1[i - 1] * 1LL * P1) % M1; } } int n, qqq; int a[N], b[N]; map<pair<int, int>, int> mp; long long ans4; void ave(pair<int, int> x, int q) { if (x.first || x.second) { ans4 += mp[m_p((M - x.first) % M, (M1 - x.second) % M1)] * 1LL * q; if (mp[m_p((M - x.first) % M, (M1 - x.second) % M1)] == 0) mp.erase(m_p((M - x.first) % M, (M1 - x.second) % M1)); } mp[x] += q; if (mp[x] == 0) mp.erase(x); } void han(pair<int, int> x, int q) { if (x.first || x.second) { ans4 -= mp[m_p((M - x.first) % M, (M1 - x.second) % M1)] * 1LL * q; if (mp[m_p((M - x.first) % M, (M1 - x.second) % M1)] == 0) mp.erase(m_p((M - x.first) % M, (M1 - x.second) % M1)); } mp[x] -= q; if (mp[x] == 0) mp.erase(x); } int p[N]; int ha[N], hb[N]; int ha1[N], hb1[N]; int qq[N]; int fi(int x) { if (x == p[x]) return x; return p[x] = fi(p[x]); } pair<int, int> u(int x) { return m_p((ha[x] - hb[x] + M) % M, (ha1[x] - hb1[x] + M1) % M1); } int main() { //freopen("input.txt", "r", stdin); pre(); scanf("%d%d", &n, &qqq); for (int i = 1; i <= n; ++i) { scanf("%d", &a[i]); b[i] = a[i]; } sort(b + 1, b + n + 1); for (int i = 1; i <= n; ++i) { p[i] = i; ha[i] = ast[a[i]]; hb[i] = ast[b[i]]; ha1[i] = ast1[a[i]]; hb1[i] = ast1[b[i]]; qq[i] = 1; ave(u(i), qq[i]); } while (qqq--) { int ty; scanf("%d", &ty); if (ty == 1) { int x, y; scanf("%d%d", &x, &y); if (fi(x) == fi(y)) continue; int xx = fi(x); int yy = fi(y); han(u(xx), qq[xx]); han(u(yy), qq[yy]); ha[xx] = (ha[xx] - ast[a[x]] + M) % M; ha[yy] = (ha[yy] - ast[a[y]] + M) % M; ha1[xx] = (ha1[xx] - ast1[a[x]] + M1) % M1; ha1[yy] = (ha1[yy] - ast1[a[y]] + M1) % M1; swap(a[x], a[y]); ha[xx] = (ha[xx] + ast[a[x]]) % M; ha[yy] = (ha[yy] + ast[a[y]]) % M; ha1[xx] = (ha1[xx] + ast1[a[x]]) % M1; ha1[yy] = (ha1[yy] + ast1[a[y]]) % M1; ave(u(xx), qq[xx]); ave(u(yy), qq[yy]); } else if (ty == 2) { int x, y; scanf("%d%d", &x, &y); if (fi(x) == fi(y)) continue; x = fi(x); y = fi(y); han(u(x), qq[x]); han(u(y), qq[y]); p[x] = y; ha[y] = (ha[y] + ha[x]) % M; hb[y] = (hb[y] + hb[x]) % M; ha1[y] = (ha1[y] + ha1[x]) % M1; hb1[y] = (hb1[y] + hb1[x]) % M1; qq[y] += qq[x]; ave(u(y), qq[y]); } else if (ty == 3) { if (mp[m_p(0, 0)] == n) printf("DA\n"); else printf("NE\n"); } else { printf("%lld\n", ans4); } } return 0; }

Compilation message (stderr)

zamjene.cpp: In function 'int main()':
zamjene.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &qqq);
     ~~~~~^~~~~~~~~~~~~~~~~~
zamjene.cpp:77:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~
zamjene.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &ty);
         ~~~~~^~~~~~~~~~~
zamjene.cpp:98:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d", &x, &y);
             ~~~~~^~~~~~~~~~~~~~~~
zamjene.cpp:120:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d", &x, &y);
             ~~~~~^~~~~~~~~~~~~~~~
#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...