제출 #546905

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
546905		fvogel499	Roller Coaster Railroad (IOI16_railroad)	C++17	0 / 100	420 ms	28544 KiB

railroad

/*
 * File created on 04/08/2022 at 21:58:56.
 * Link to problem: 
 * Description: 
 * Time complexity: O()
 * Space complexity: O()
 * Status: ---
 * Copyright: Ⓒ 2022 Francois Vogel
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>

using namespace std;
using namespace __gnu_pbds;

#define pii pair<int, int>
#define f first
#define s second

#define vi vector<int>
#define all(x) x.begin(), x.end()
#define size(x) (int)((x).size())
#define pb push_back
#define ins insert
#define cls clear

#define int ll
#define ll long long
#define ld long double

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int plan_roller_coaster(vector<signed> from, vector<signed> to) {
    for (int i = 0; i < size(from); i++) {
        from[i] *= 2LL;
        to[i] *= 2LL;
        if (from[i] < to[i]) from[i]++;
        else if (to[i] < from[i]) to[i]++;
    }
    map<int, int> m;
    for (int i = 0; i < size(from); i++) {
        if (!m.count(from[i])) m[from[i]] = 0;
        m[from[i]]++;
        if (!m.count(to[i])) m[to[i]] = 0;
        m[to[i]]--;
    }
    int sum = 0;
    for (auto i : m) {
        sum += i.s;
        if (sum > 1) return 1;
    }
    return 0;
}

// signed main() {
//     cin.tie(0);
//     ios_base::sync_with_stdio(0);

//     int n;
//     cin >> n;
//     vector<signed> from(n), to(n);
//     for (int i = 0; i < n; i++) cin >> from[i];
//     for (int i = 0; i < n; i++) cin >> to[i];
//     cout << plan_roller_coaster(from, to) << endl;

//     cout.flush();
//     int d = 0;
//     d++;
// }

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36