Submission #299092

#TimeUsernameProblemLanguageResultExecution timeMemory
299092eriksuenderhaufMonochrome Points (JOI20_monochrome)C++17
35 / 100
2086 ms15380 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e5 + 5; int a[4*N], nxt[3*N][2]; int idx[4*N][2], vis[2*N]; ll solve(int n, int i) { int ptr[2] = {i+n, i+n}; int lo = idx[nxt[i+n][a[i]]][a[i]^1] - idx[nxt[i][a[i]^1]][a[i]]; int hi = idx[nxt[i+n][a[i]^1]][a[i]] - idx[nxt[i][a[i]]][a[i]^1]; if (vis[hi]) return 0; vis[hi] = 1; ll val = 0; for (int j = i; j < i+n; ++j) val += min((ptr[a[j]] = nxt[ptr[a[j]]][a[j]] + 1) - n - i - 1, j - i); return val; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s; cin >> s; for (int i = 0; i < 2*n; i++) a[i] = a[i+2*n] = s[i] == 'B'; nxt[3*n][0] = nxt[3*n][1] = 3*n; for (int i = 3*n-1; i >= 0; i--) { nxt[i][0] = nxt[i+1][0], nxt[i][1] = nxt[i+1][1]; nxt[i][a[i]^1] = i; } idx[0][a[0]] = 1, idx[0][a[0]^1] = 0; for (int i = 1; i < 4*n; i++) { idx[i][0] = idx[i-1][0], idx[i][1] = idx[i-1][1]; idx[i][a[i]]++; } ll ans = solve(n, 0); int idx = 0; for (int i = 0; i < n; i++) if (s[i] == s[i+n]) ans = max(ans, solve(n, i)); cout << ans << "\n"; }

Compilation message (stderr)

monochrome.cpp: In function 'll solve(int, int)':
monochrome.cpp:10:7: warning: unused variable 'lo' [-Wunused-variable]
   10 |   int lo = idx[nxt[i+n][a[i]]][a[i]^1] - idx[nxt[i][a[i]^1]][a[i]];
      |       ^~
monochrome.cpp: In function 'int main()':
monochrome.cpp:38:7: warning: unused variable 'idx' [-Wunused-variable]
   38 |   int idx = 0;
      |       ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...