Submission #925893

#TimeUsernameProblemLanguageResultExecution timeMemory
925893boris_mihovMonochrome Points (JOI20_monochrome)C++17
25 / 100
2008 ms6744 KiB
#include <algorithm> #include <iostream> #include <numeric> #include <cassert> #include <cstring> #include <vector> #include <queue> #include <stack> #include <set> typedef long long llong; const int MAXN = 400000 + 10; const int INF = 2e9; int n; int w[MAXN]; int b[MAXN]; char s[MAXN]; int f[MAXN]; int fPrim[MAXN]; std::vector <std::pair <int,int>> v; int solveFor(int k) { v.clear(); for (int i = 1 ; i <= n ; ++i) { v.push_back({std::min(w[i], b[(i + k - 1) % n + 1]), std::max(w[i], b[(i + k - 1) % n + 1])}); } int res = 0; std::sort(v.begin(), v.end()); for (int i = 0 ; i < n ; ++i) { for (int j = i + 1 ; j < n ; ++j) { res += (v[j].first < v[i].second && v[i].second < v[j].second); } } return res; } void solve() { int cntW = 1; int cntB = 1; for (int i = 1 ; i <= 2 * n ; ++i) { if (s[i] == s[1]) w[cntW++] = i; else b[cntB++] = i; } int max = 0; for (int i = 0 ; i < n ; ++i) { // std::cout << "here: " << i << ' ' << solveFor(i) << '\n'; f[i] = solveFor(i); max = std::max(max, solveFor(i)); if (i >= 1) { fPrim[i - 1] = f[i] - f[i]; // assert(solveFor(i) - solveFor(i - 1) >= solveFor(i + 1) - solveFor(i)); } } for (int i = 1 ; i < n - 2 ; ++i) { assert(fPrim[i - 1] - fPrim[i] >= fPrim[i] - fPrim[i + 1]); } std::cout << max << '\n'; } void input() { std::cin >> n; std::cin >> s + 1; } void fastIOI() { std::ios_base :: sync_with_stdio(0); std::cout.tie(nullptr); std::cin.tie(nullptr); } int main() { fastIOI(); input(); solve(); return 0; }

Compilation message (stderr)

monochrome.cpp: In function 'void input()':
monochrome.cpp:78:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   78 |     std::cin >> s + 1;
      |                 ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...