| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 449998 | vanic | 007 (CEOI14_007) | C++14 | 1092 ms | 15252 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 <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstring>
#include <queue>
#include <cassert>
#include <set>
#include <array>
using namespace std;
const int maxn=2e5+5;
vector < int > ms[maxn];
int a, b, c, d;
bool bio[2][maxn];
int n, m;
bool provjeri(int x){
set < array < int, 3 > > s;
memset(bio, 0, sizeof(bio));
s.insert({0, 0, b});
s.insert({x, 1, a});
array < int, 3 > y;
while(!s.empty()){
y=*s.begin();
s.erase(s.begin());
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||