# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780450 | egekabas | Teams (IOI15_teams) | C++14 | 891 ms | 32076 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 "teams.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
int n;
vector<int> startHere[100009];
vector<int> seg[400009];
void initSeg(int v, int tl, int tr){
if(tl == tr){
seg[v] = startHere[tl];
sort(all(seg[v]));
} else{
int tm = (tl+tr)/2;
initSeg(2*v, tl, tm);
initSeg(2*v+1, tm+1, tr);
seg[v].resize(seg[2*v].size() + seg[2*v+1].size());
merge(all(seg[2*v]), all(seg[2*v+1]), seg[v].begin());
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |