# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668618 | wakaka | Flight to the Ford (BOI22_communication) | C++17 | 6965 ms | 2388 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "communication.h"
#include <bits/stdc++.h>
using namespace std;
//
// --- Sample implementation for the task communication ---
//
// To compile this program with the sample grader, place:
// communication.h communication_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
// g++ -std=c++17 communication_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
bool split(set<array<int, 2>>& s, int p) {
if (p == INT_MIN) return false;
auto it = s.lower_bound({p, p - 1}); // Use p-1 to handle array<int, >= 2> case.
if (it == s.begin()) return false;
--it;
auto cur = *it;
assert(cur[0] < p);
if (cur[1] < p) return false;
s.erase(it);
auto l = cur;
l[1] = p - 1;
s.insert(l); // {cur[0], p - 1, cur[2...]}
auto r = cur;
r[0] = p;
s.insert(r); // {p, cur[1], cur[2...]}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |