# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499968 | kappa | Autobahn (COI21_autobahn) | C++14 | 1 ms | 308 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;
struct person{
int begin;
int pay;
int end;
};
int n, k, x, maxEnd, ans, val[100005], p[100005];
person d[100005];
int main(){
cin >> n >> k >> x;
for (int i = 0; i < n; i++)
{
cin >> d[i].begin >> d[i].pay >> d[i].end;
maxEnd = max(maxEnd, d[i].end);
d[i].begin--;
d[i].end--;
}
for (int i = 0; i < maxEnd; i++)
{
for (int j = 0; j < n; j++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |