# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420412 | Pyqe | Autobahn (COI21_autobahn) | C++14 | 112 ms | 15996 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;
#define mp make_pair
#define fr first
#define sc second
const long long inf=1e18;
long long n,m,d,ps[2][400069];
pair<long long,pair<long long,long long>> a[400069];
int main()
{
long long i,ii,k,l,w,c[2]={0,0},e,p,z=0;
scanf("%lld%lld%lld",&n,&m,&d);
for(i=1;i<=n;i++)
{
scanf("%lld%lld%lld",&k,&w,&l);
a[i*4-3]={k-1,{0,1}};
a[i*4-2]={k+w-1,{1,1}};
a[i*4-1]={l,{0,-1}};
a[i*4]={l,{1,-1}};
}
sort(a+1,a+n*4+1);
for(i=1;i<=n*4;i++)
{
k=a[i].fr;
e=a[i].sc.fr;
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... |