oj.uz

답안 #29491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
29491 2017-07-19T13:38:20 Z Nikefor 악어의 지하 도시 (IOI11_crocodile) C++
0 / 100
 816 ms 170304 KB 
#include "crocodile.h"
#include<bits/stdc++.h>
#define ii pair<int,int>
using namespace std;
int visit[100002];
int res;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    priority_queue<ii, vector<ii>, greater<ii> > q;
    vector<ii> adj[N+2];
    for(int i=0; i<M; i++) {
        int v1 = R[i][0], v2 = R[i][1];
        adj[v1].push_back(make_pair(v2,i));
        adj[v2].push_back(make_pair(v1,i));
    }
    for(int i=0; i<K; i++) { q.push(make_pair(0,P[i])); visit[P[i]]++; }
    while(!q.empty()) {
         ii e = q.top();
         int v = e.second;
     //    printf("%d deyim\n", v);
         q.pop();
         if(!visit[v]) {
            visit[v]++;
            continue;
         }
         visit[v]++;
        if(!v){
            res = e.first;
            break;
        }
        for(int i=0; i<adj[v].size(); i++) {
            if(visit[adj[v][i].first]<2) q.push(make_pair(e.first+L[adj[v][i].second], adj[v][i].first ));
        }

    }





  return res;
}

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:31:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<adj[v].size(); i++) {
                       ^

Subtask #1
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 119796 KB Output is correct
2 Correct 0 ms 119796 KB Output is correct
3 Incorrect 0 ms 119796 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 120072 KB Output is correct
2 Correct 0 ms 119796 KB Output is correct
3 Incorrect 0 ms 119928 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 816 ms 170304 KB Output isn't correct
2 Halted 0 ms 0 KB -