# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290182 | groeneprof | Cloud Computing (CEOI18_clo) | C++14 | 99 ms | 116984 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>
#define int long long
#define P(a) do{if(debug) cout<<a<<endl;} while(false)
#define H(a) P(#a<<": "<<a)
#define FR(i,a,b) for(int i = (a); i<(b); i++)
#define F(i,n) FR(i,0,n)
#define f first.first
#define c first.second
#define v second
#define ppiii pair<pair<int,int>, int>
const bool debug = 0;
const int inf = 1e9;
using namespace std;
int n,m;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
vector<ppiii> comp(n);
F(i,n){
cin>>comp[i].c>>comp[i].f>>comp[i].v;
}
cin>>m;
vector<ppiii> task(m);
F(i,m){
cin>>task[i].c>>task[i].f>>task[i].v;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |