제출 #1315163

#제출 시각아이디문제언어결과실행 시간메모리
1315163kantaponzHandcrafted Gift (IOI20_gift)C++20
100 / 100
85 ms17476 KiB
#include "gift.h"
#include <bits/stdc++.h>
using namespace std;

vector<tuple<int,int,int>> v;
int A[500005];
int qs[500005];
bool same[500005];

int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
    for (int i = 0; i < r; i++) {
        a[i]++; b[i]++;
        if (x[i] == 1) {
            A[a[i]]++;
            A[b[i] + 1]--;
        }
    }
    for (int i = 1; i <= n; i++) {
        A[i] += A[i - 1];
        if (A[i] > 0) {
            same[i] = true;
        }
    }
    bool prev = false;
    for (int i = 1; i <= n; i++) {
        if (prev == 1 && same[i] == 1) {
            qs[i] = qs[i - 1];
        } else {
            qs[i] = (qs[i - 1] + 1) % 2;
        }
        prev = same[i];
    }
    for (int i = 1; i <= n; i++) {
        qs[i] += qs[i - 1];
    }
    for (int i = 0; i < r; i++) {
        if (x[i] == 1) continue;
        if (qs[b[i]] - qs[a[i] - 1] == b[i] - a[i] + 1 || qs[b[i]] - qs[a[i] - 1] == 0) return 0;
    }

    string S = "";
    for (int i = 1; i <= n; i++) {
        int d = qs[i] - qs[i - 1];
        if (d == 1) S += 'R';
        else S += 'B';
    }

    craft(S);
    return 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...
#Verdict Execution timeMemoryGrader output
Fetching results...