oj.uz

답안 #366297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366297 2021-02-13T20:04:47 Z arman_ferdous Monochrome Points (JOI20_monochrome) C++17
25 / 100
 36 ms 512 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define dbg(x) cerr << #x << " is " << x << "\n";
#define cum cerr << "came\n";

using ll = long long;
using ii = pair<ll,ll>;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 2010;

int n;
char s[N];

struct event {
  int x, y;
  int type;
  bool operator<(event o) const {
    return x < o.x;
  }
};
vector<event> e;
oset os;

int vis[N];
vector<pair<int, int>> segs;

ll getcost() {
  e.clear();
  for(auto it : segs) {
    e.pb({it.fi, it.se, 0});
    e.pb({it.se, it.fi, 1});
  } sort(all(e));

  ll ret = 0;
  for(auto i : e) {
    if(i.type == 0) {
      ret += os.order_of_key(i.y);
      os.insert(i.y);
    }
    else {
      os.erase(i.x);
    }
  }
  os.clear();
  return ret;
}

ll solve(int p, int q) {
  segs.clear();
  for(int i = 0; i < n + n; i++) vis[i] = 0;
  segs.pb({p, q});
  vis[p] = vis[q] = 1;

  int matched = 1;
  int i = p, j = q;
  while(matched < n) {
    while(vis[i] || s[i] != s[p]) {
      i++;
      if(i == n + n) i = 0;
    }

    while(s[i] == s[j] || vis[j]) {
      j++; 
      if(j == n + n) j = 0;
    }

    vis[j] = vis[i] = 1;
    segs.pb({min(i, j), max(i, j)});
    matched++;
  }

  // for(auto it : segs)
  //   cout << it.fi + 1 << " " << it.se + 1 << endl;
  // cout << "cost = " << getcost() << endl;

  return getcost();
}

int main() {
  ll ans = 0;
  scanf("%d %s", &n, s);
  for(int i = 1; i < n + n; i++) if(s[0] != s[i]) {
    ans = max(ans, solve(0, i));
    // cout << "/////////\n";
  }
  printf("%lld\n", ans);
  return 0;
}

Compilation message

monochrome.cpp: In function 'int main()':
monochrome.cpp:91:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   91 |   scanf("%d %s", &n, s);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 29 ms 364 KB Output is correct
15 Correct 29 ms 364 KB Output is correct
16 Correct 33 ms 364 KB Output is correct
17 Correct 28 ms 364 KB Output is correct
18 Correct 21 ms 364 KB Output is correct
19 Correct 28 ms 364 KB Output is correct
20 Correct 30 ms 364 KB Output is correct
21 Correct 22 ms 364 KB Output is correct
22 Correct 22 ms 384 KB Output is correct
23 Correct 12 ms 364 KB Output is correct
24 Correct 21 ms 364 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 26 ms 364 KB Output is correct
27 Correct 26 ms 364 KB Output is correct
28 Correct 36 ms 364 KB Output is correct
29 Correct 22 ms 492 KB Output is correct
30 Correct 22 ms 492 KB Output is correct
31 Correct 29 ms 364 KB Output is correct
32 Correct 29 ms 384 KB Output is correct
33 Correct 24 ms 364 KB Output is correct

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 29 ms 364 KB Output is correct
15 Correct 29 ms 364 KB Output is correct
16 Correct 33 ms 364 KB Output is correct
17 Correct 28 ms 364 KB Output is correct
18 Correct 21 ms 364 KB Output is correct
19 Correct 28 ms 364 KB Output is correct
20 Correct 30 ms 364 KB Output is correct
21 Correct 22 ms 364 KB Output is correct
22 Correct 22 ms 384 KB Output is correct
23 Correct 12 ms 364 KB Output is correct
24 Correct 21 ms 364 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 26 ms 364 KB Output is correct
27 Correct 26 ms 364 KB Output is correct
28 Correct 36 ms 364 KB Output is correct
29 Correct 22 ms 492 KB Output is correct
30 Correct 22 ms 492 KB Output is correct
31 Correct 29 ms 364 KB Output is correct
32 Correct 29 ms 384 KB Output is correct
33 Correct 24 ms 364 KB Output is correct
34 Incorrect 1 ms 364 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #4
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 29 ms 364 KB Output is correct
15 Correct 29 ms 364 KB Output is correct
16 Correct 33 ms 364 KB Output is correct
17 Correct 28 ms 364 KB Output is correct
18 Correct 21 ms 364 KB Output is correct
19 Correct 28 ms 364 KB Output is correct
20 Correct 30 ms 364 KB Output is correct
21 Correct 22 ms 364 KB Output is correct
22 Correct 22 ms 384 KB Output is correct
23 Correct 12 ms 364 KB Output is correct
24 Correct 21 ms 364 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 26 ms 364 KB Output is correct
27 Correct 26 ms 364 KB Output is correct
28 Correct 36 ms 364 KB Output is correct
29 Correct 22 ms 492 KB Output is correct
30 Correct 22 ms 492 KB Output is correct
31 Correct 29 ms 364 KB Output is correct
32 Correct 29 ms 384 KB Output is correct
33 Correct 24 ms 364 KB Output is correct
34 Incorrect 1 ms 364 KB Output isn't correct
35 Halted 0 ms 0 KB -