oj.uz

Submission #485362

# Submission time Handle Problem Language Result Execution time Memory
485362 2021-11-07T09:47:49 Z MilosMilutinovic Handcrafted Gift (IOI20_gift) C++14
100 / 100
 150 ms 22784 KB 
/**
 *    author: m371
 *    created: 07.11.2021 10:35:40
**/
#include "gift.h"
#include <bits/stdc++.h>

using namespace std;

class dsu {
  public:
  vector<int> p;
  int n;
  dsu(int _n) : n(_n) {
    p.resize(n);
    iota(p.begin(), p.end(), 0);
  }
  inline int get(int x) {
    return (x == p[x] ? x : (p[x] = get(p[x])));
  }
  inline bool unite(int x, int y) {
    x = get(x);
    y = get(y);
    if (x != y) {
      p[x] = y;
      return true;
    }
    return false;
  }
};
           
int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
  dsu d(n);            
  for (int i = 0; i < r; i++) {
    if (x[i] == 1) {
      int j = d.get(a[i]);    
      while (j <= b[i] && d.get(j) != d.get(b[i])) {
        d.unite(j, b[i]);
        j = d.get(j + 1);
      }
    }
  }
  for (int i = 0; i < r; i++) {
    if (x[i] == 2) {
      if (d.get(a[i]) == d.get(b[i])) {
        return 0;      
      }
    }
  }
  string ans = "R";
  for (int i = 1; i < n; i++) {
    if (d.get(i) != d.get(i - 1)) {
      ans += (ans.back() ^ 'R' ^ 'B');
    } else {
      ans += ans.back();
    }
  }
  craft(ans);
  return 1;  
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 135 ms 15184 KB Output is correct
6 Correct 139 ms 15056 KB Output is correct
7 Correct 144 ms 15048 KB Output is correct
8 Correct 140 ms 15084 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 716 KB Output is correct
4 Correct 136 ms 15196 KB Output is correct
5 Correct 129 ms 15192 KB Output is correct
6 Correct 124 ms 14092 KB Output is correct
7 Correct 126 ms 14108 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 135 ms 15184 KB Output is correct
6 Correct 139 ms 15056 KB Output is correct
7 Correct 144 ms 15048 KB Output is correct
8 Correct 140 ms 15084 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 136 ms 15196 KB Output is correct
13 Correct 129 ms 15192 KB Output is correct
14 Correct 124 ms 14092 KB Output is correct
15 Correct 126 ms 14108 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 6 ms 3336 KB Output is correct
36 Correct 6 ms 3436 KB Output is correct
37 Correct 12 ms 4080 KB Output is correct
38 Correct 145 ms 22724 KB Output is correct
39 Correct 143 ms 21520 KB Output is correct
40 Correct 150 ms 22784 KB Output is correct
41 Correct 147 ms 22656 KB Output is correct
42 Correct 148 ms 22272 KB Output is correct