# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41586 | chonka | Commuter Pass (JOI18_commuter_pass) | C++98 | 589 ms | 20004 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<iostream>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std ;
#define MAXN 200007
long long inf ;
int n , m ;
int p1 , p2 ;
int p3 , p4 ;
vector < pair < int , int > > v[ MAXN ] ;
long long f[ MAXN ][ 5 ] ;
long long dp[ MAXN ][ 3 ] ;
struct tuhla {
int vertex ;
long long cost ;
tuhla ( ) { vertex = cost = 0 ; }
tuhla ( int _vertex , long long _cost ) {
vertex = _vertex ;
cost = _cost ;
}
};
bool operator < ( tuhla aux1 , tuhla aux2 ) {
return ( aux1.cost > aux2.cost ) ;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |