제출 #1357995

#제출 시각아이디문제언어결과실행 시간메모리
1357995toast12Handcrafted Gift (IOI20_gift)C++20
15 / 100
62 ms21244 KiB
#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) {
    vector<int> ans(n, -1);
    vector<pair<int, int>> p, q;
    for (int i = 0; i < r; i++) {
        if (x[i] == 1) p.push_back({a[i], b[i]});
        else q.push_back({a[i], b[i]});
    }
    int cur = 0;
    p.push_back({-1, -1});
    sort(p.begin(), p.end());
    vector<int> v(n, -1);
    for (int i = 1; i < p.size(); i++) {
        if (p[i].first > p[i-1].second) {
            for (int j = p[i-1].second+1; j < p[i].first; j++) v[j] = ++cur;
            ++cur;
        }
        for (int j = p[i].first; j <= p[i].second; j++) v[j] = cur;
    }
    for (int j = p.back().second+1; j < n; j++) v[j] = ++cur;
    for (int i = 0; i < q.size(); i++) {
        if (v[q[i].first] == v[q[i].second]) return 0;
    }
    for (int i = 0; i < n; i++) {
        ans[i] = v[i]%2;
    }
    string s = "";
    string temp = "RB";
    for (int i = 0; i < n; i++) s += temp[ans[i]];
    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...