# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9182 | corea | Your life (kriii2_Y) | C++14 | 88 ms | 6952 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 <stdio.h>
#include <vector>
#include <queue>
using namespace std;
bool V[ 100003 ];
vector<int> data[ 100003 ];
priority_queue< pair<int, int> > pq;
int N, M;
int main() {
scanf( "%d %d", &N, &M );
while( M -- ) {
int a, b;
scanf( "%d %d", &a, &b );
data[ a ].push_back( b );
}
pq.emplace( 0, 1 );
while( !pq.empty() ) {
pair<int, int> now = pq.top();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |