# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
764929 | vjudge1 | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 12 ms | 340 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 ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
const ll N = 1e6 + 9;
const ll M = 5e3 + 9;
const ll MOD = 1e9 + 7;
void be (){
ios_base::sync_with_stdio (0);
cin.tie (0);
}
void solve (){
int n;
cin >> n;
ll q = 0;
for (int i = 1; i < n; ++i){
int l, r, u;
cin >> l >> r >> u;
q += u;
}
int m;
cin >> m;
while (m--){
int z[6];
# | 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... |