# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502461 | wwdd | Cloud Computing (CEOI18_clo) | C++14 | 328 ms | 2180 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.
// bruh this time complexity is so bad
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
const ll INFL = 1e18;
struct OP {
ll op,kt,val,so;
OP(ll op_, ll kt_, ll val_, ll so_): op(op_), kt(kt_), val(val_), so(so_) {
}
bool operator<(const OP& ot) const {
if(so != ot.so) {return so > ot.so;}
return op > ot.op;
};
};
int main() {
ios::sync_with_stdio(0);cin.tie(0);
vector<OP> ops;
ll n;
cin >> n;
for(int i=0;i<n;i++) {
ll kt,so,val;
cin >> kt >> so >> val;
ops.emplace_back(1,kt,val,so);
}
ll m;
cin >> m;
for(int i=0;i<m;i++) {
ll kt,so,val;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |