oj.uz

Submission #946460

# Submission time Handle Problem Language Result Execution time Memory
946460 2024-03-14T16:47:49 Z xynex Monochrome Points (JOI20_monochrome) C++17
35 / 100
 1468 ms 13880 KB 
/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A>  void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 1e14;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

const int N = 2e5 + 5;
const int M = 2e6 + 6;

int n;
vt<int> w, b;
int t[4 * N];
void upd(int pos, int val, int tl = 1, int tr = 2 * n, int v = 1) {
  if(tl == tr) t[v] = val;
  else {
    int mid = (tl + tr) >> 1;
    if(mid >= pos) upd(pos, val, tl, mid, v * 2);
    else upd(pos, val, mid + 1, tr, v * 2 + 1);
    t[v] = t[v * 2] + t[v * 2 + 1];
  }
}
int get(int l, int r, int tl = 1, int tr = 2 * n, int v = 1) {
  if(tl > r || tr < l) return 0;
  if(tl >= l && tr <= r) return t[v];
  int mid = (tl + tr) >> 1;
  return get(l, r, tl, mid, v * 2) + get(l, r, mid + 1, tr, v * 2 + 1);
}
void solve() {
  read(n);
  for(int i = 1; i <= 2 * n; ++i) {
    char s; read(s);
    if(s == 'B') b.pb(i);
    else w.pb(i);
  }
  ll res = 0  ;
  for(int i = 0; i < n; ++i) {
    vt<pr<int, int>> ord;
    for(int j = 0; j < n; ++j) {
      int X = w[j];
      int Y = b[(j + i) % n];
      if(X > Y) swap(X, Y);
      ord.pb({X, Y});
    }
    sort(all(ord));
    /*for(int j = 0; j < n; ++j) {
      //upd(ord[j].ff, 1);
      print(ord[j].ff, ord[j].ss);
    }*/
    for(int j = 1; j <= 2 * n; ++j) upd(j, 0);
    ll ans = 0;
    for(int j = 0; j < n; ++j) {
      ans += get(ord[j].ff, ord[j].ss);
     // print(ans);
      upd(ord[j].ss, 1);
    }
   // print(ans);
    res = max(res, ans);
  }
  print(res);
}

int main() {
  srand(time(NULL));
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  //freop("");
  int t = 1;
  //read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}

Compilation message

monochrome.cpp: In function 'void freop(std::string)':
monochrome.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
monochrome.cpp:74:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 29 ms 348 KB Output is correct
15 Correct 26 ms 348 KB Output is correct
16 Correct 27 ms 348 KB Output is correct
17 Correct 29 ms 348 KB Output is correct
18 Correct 18 ms 604 KB Output is correct
19 Correct 22 ms 348 KB Output is correct
20 Correct 22 ms 604 KB Output is correct
21 Correct 19 ms 348 KB Output is correct
22 Correct 21 ms 348 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 21 ms 348 KB Output is correct
25 Correct 18 ms 476 KB Output is correct
26 Correct 19 ms 344 KB Output is correct
27 Correct 23 ms 348 KB Output is correct
28 Correct 25 ms 488 KB Output is correct
29 Correct 21 ms 348 KB Output is correct
30 Correct 21 ms 468 KB Output is correct
31 Correct 25 ms 492 KB Output is correct
32 Correct 26 ms 352 KB Output is correct
33 Correct 28 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 29 ms 348 KB Output is correct
15 Correct 26 ms 348 KB Output is correct
16 Correct 27 ms 348 KB Output is correct
17 Correct 29 ms 348 KB Output is correct
18 Correct 18 ms 604 KB Output is correct
19 Correct 22 ms 348 KB Output is correct
20 Correct 22 ms 604 KB Output is correct
21 Correct 19 ms 348 KB Output is correct
22 Correct 21 ms 348 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 21 ms 348 KB Output is correct
25 Correct 18 ms 476 KB Output is correct
26 Correct 19 ms 344 KB Output is correct
27 Correct 23 ms 348 KB Output is correct
28 Correct 25 ms 488 KB Output is correct
29 Correct 21 ms 348 KB Output is correct
30 Correct 21 ms 468 KB Output is correct
31 Correct 25 ms 492 KB Output is correct
32 Correct 26 ms 352 KB Output is correct
33 Correct 28 ms 348 KB Output is correct
34 Correct 1427 ms 532 KB Output is correct
35 Correct 1431 ms 536 KB Output is correct
36 Correct 1353 ms 528 KB Output is correct
37 Correct 1272 ms 528 KB Output is correct
38 Correct 1173 ms 528 KB Output is correct
39 Correct 1332 ms 532 KB Output is correct
40 Correct 1158 ms 856 KB Output is correct
41 Correct 1055 ms 468 KB Output is correct
42 Correct 1406 ms 532 KB Output is correct
43 Correct 1381 ms 528 KB Output is correct
44 Correct 1240 ms 348 KB Output is correct
45 Correct 1298 ms 528 KB Output is correct
46 Correct 1468 ms 604 KB Output is correct
47 Correct 1428 ms 528 KB Output is correct
48 Correct 1365 ms 528 KB Output is correct
49 Correct 1190 ms 532 KB Output is correct
50 Correct 1441 ms 532 KB Output is correct
51 Correct 1362 ms 528 KB Output is correct
52 Correct 1436 ms 532 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 29 ms 348 KB Output is correct
15 Correct 26 ms 348 KB Output is correct
16 Correct 27 ms 348 KB Output is correct
17 Correct 29 ms 348 KB Output is correct
18 Correct 18 ms 604 KB Output is correct
19 Correct 22 ms 348 KB Output is correct
20 Correct 22 ms 604 KB Output is correct
21 Correct 19 ms 348 KB Output is correct
22 Correct 21 ms 348 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 21 ms 348 KB Output is correct
25 Correct 18 ms 476 KB Output is correct
26 Correct 19 ms 344 KB Output is correct
27 Correct 23 ms 348 KB Output is correct
28 Correct 25 ms 488 KB Output is correct
29 Correct 21 ms 348 KB Output is correct
30 Correct 21 ms 468 KB Output is correct
31 Correct 25 ms 492 KB Output is correct
32 Correct 26 ms 352 KB Output is correct
33 Correct 28 ms 348 KB Output is correct
34 Correct 1427 ms 532 KB Output is correct
35 Correct 1431 ms 536 KB Output is correct
36 Correct 1353 ms 528 KB Output is correct
37 Correct 1272 ms 528 KB Output is correct
38 Correct 1173 ms 528 KB Output is correct
39 Correct 1332 ms 532 KB Output is correct
40 Correct 1158 ms 856 KB Output is correct
41 Correct 1055 ms 468 KB Output is correct
42 Correct 1406 ms 532 KB Output is correct
43 Correct 1381 ms 528 KB Output is correct
44 Correct 1240 ms 348 KB Output is correct
45 Correct 1298 ms 528 KB Output is correct
46 Correct 1468 ms 604 KB Output is correct
47 Correct 1428 ms 528 KB Output is correct
48 Correct 1365 ms 528 KB Output is correct
49 Correct 1190 ms 532 KB Output is correct
50 Correct 1441 ms 532 KB Output is correct
51 Correct 1362 ms 528 KB Output is correct
52 Correct 1436 ms 532 KB Output is correct
53 Runtime error 45 ms 13880 KB Execution killed with signal 11
54 Halted 0 ms 0 KB -