oj.uz

Submission #952945

# Submission time Handle Problem Language Result Execution time Memory
952945 2024-03-25T06:42:51 Z kilikuma Handcrafted Gift (IOI20_gift) C++17
100 / 100
 133 ms 26784 KB 
#include "gift.h"
#include <bits/stdc++.h>

using namespace std;

int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
    int painting[n + 1] = {0};
    for (int i = 0; i < r; i ++) {
      if (x[i] == 1) {
        painting[b[i] + 1] --;
        painting[a[i]] ++;
      }
    }
    for (int i = 1; i < n; i ++) {
      painting[i] += painting[i - 1];
    }

    int encrypt[n + 1] = {0};
    int ind = 0, color = 0;
    string s(n, 'R');

    while (ind < n) {
      if (painting[ind] == 0) {
        encrypt[ind] = color;
        ind ++;
      }
      else {
        while ((ind < n) and (painting[ind] >= 1)) {
          encrypt[ind] = color;
          ind ++;
        }
      }
      color = (color + 1) % 2;
    }

    for (int i = 0; i < n; i ++) {
      if (encrypt[i] == 0) s[i] = 'R';
      else s[i] = 'B';
    }

    int pref[n + 1] = {0};
    for (int i = 1; i <= n; i ++) {
      pref[i] = encrypt[i] + pref[i - 1];
    }
    for (int i = 0; i < r; i ++) {
      int cible = pref[b[i]] - pref[a[i] - 1];
      int longueur = b[i] - a[i] + 1;
      if (x[i] == 2) {
        if ((0 < cible) and (cible < longueur)) ;
        else {
          return 0;
        }
      }
      else {
        if ((0 < cible) and (cible < longueur)) return 0;
        else ;
      }
    }
    craft(s);
    return 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 820 KB Output is correct
5 Correct 110 ms 26708 KB Output is correct
6 Correct 110 ms 26652 KB Output is correct
7 Correct 112 ms 26784 KB Output is correct
8 Correct 112 ms 26704 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 115 ms 26504 KB Output is correct
5 Correct 110 ms 26656 KB Output is correct
6 Correct 108 ms 25936 KB Output is correct
7 Correct 109 ms 26124 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
25.0 / 25.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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 480 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 856 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 820 KB Output is correct
5 Correct 110 ms 26708 KB Output is correct
6 Correct 110 ms 26652 KB Output is correct
7 Correct 112 ms 26784 KB Output is correct
8 Correct 112 ms 26704 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 115 ms 26504 KB Output is correct
13 Correct 110 ms 26656 KB Output is correct
14 Correct 108 ms 25936 KB Output is correct
15 Correct 109 ms 26124 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 432 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 480 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 856 KB Output is correct
35 Correct 7 ms 7280 KB Output is correct
36 Correct 8 ms 7280 KB Output is correct
37 Correct 11 ms 8048 KB Output is correct
38 Correct 114 ms 26516 KB Output is correct
39 Correct 124 ms 26452 KB Output is correct
40 Correct 132 ms 26448 KB Output is correct
41 Correct 116 ms 26648 KB Output is correct
42 Correct 133 ms 26256 KB Output is correct