# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810585 | welleyth | Cloud Computing (CEOI18_clo) | C++17 | 391 ms | 1412 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;
constexpr int N = (int)7e5;
void solve(){
int n;
cin >> n;
int c[n],f[n],v[n];
for(int i = 0; i < n; i++){
cin >> c[i] >> f[i] >> v[i];
}
int m;
cin >> m;
int C[m],F[m],V[m];
int sumOrderC = 0;
for(int i = 0; i < m; i++){
cin >> C[i] >> F[i] >> V[i];
sumOrderC += C[i];
}
{
vector<int> s;
for(int i = 0; i < m; i++){
s.push_back(F[i]);
# | 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... |