# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5346 | model_code | 버스 (JOI14_bus) | C++98 | 308 ms | 10796 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 <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
struct bus{
int a,b,x,y;
};
bool operator<(bus b1,bus b2)
{
return b1.x<b2.x;
}
int main()
{
int n,m,t=0;
scanf("%d%d",&n,&m);
static bus B[300000];
for(int i=0;i<m;i++){
scanf("%d%d%d%d",&(B[i].a),&(B[i].b),&(B[i].x),&(B[i].y));
B[i].a--;
B[i].b--;
}
sort(B,B+m);
static int E[100000],F[300000];
for(int i=0;i<n;i++){
E[i]=-1;
# | 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... |