# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005962 | PoPularPlusPlus | Cake 3 (JOI19_cake3) | C++17 | 0 ms | 348 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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) x.begin(),x.end()
#define vf first
#define vs second
const int mod = 1000000007;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
const int N = 200004;
int n , m;
vector<pair<ll,ll>> arr;
ll ans;
bool cmp(pair<int,int> a , pair<int,int> b){
if(a.vs == b.vs)return a.vf > b.vf;
return a.vs < b.vs;
}
struct item {
vector<int> left , right;
};
void unite(vector<int>& a , vector<int>& b){
vector<int> v;
for(int i : a)v.pb(i);
for(int i : b)v.pb(i);
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... |