oj.uz

답안 #329723

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329723 2020-11-22T07:16:28 Z NintsiChkhaidze 기지국 (IOI20_stations) C++14
10 / 100
 897 ms 1108 KB 
#include "stations.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
vector <int> vec[1005];
int cnt,in[1005],out[1005];
void dfs(int x,int p){
    in[x] = cnt++;
    for (int j=0;j<vec[x].size();j++){
        int to = vec[x][j];
        if (to == p) continue;
        dfs(to,x);
    }
    out[x] = cnt++;
}
 
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    vector<int> labels;
    for (int i=0;i<1001;i++){
        vec[i].clear();
        in[i] = out[i] = 0;
    }
    for (int i=0;i<u.size();i++){
        vec[u[i]].pb(v[i]);
        vec[v[i]].pb(u[i]);
    }
    
    cnt=0;
    dfs(0,0);
    for (int i=0;i<n;i++)
        labels.pb(in[i]*1000 + out[i]);
    
    return labels;
}
int find_next_station(int s, int t, vector<int> c) {
    int Ins = (s/1000),Int = (t/1000),Out = (t%1000);
    if (Ins < Int){
        for (int i=1;i<c.size();i++)
            if (Int >= (c[i]/1000) && (c[i]%1000) >= Out) return c[i];
    }
    return c[0];
}

Compilation message

stations.cpp: In function 'void dfs(int, int)':
stations.cpp:9:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for (int j=0;j<vec[x].size();j++){
      |                  ~^~~~~~~~~~~~~~
stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i=0;i<u.size();i++){
      |                  ~^~~~~~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i=1;i<c.size();i++)
      |                      ~^~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=7014
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 364 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=0, label=1991
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 612 KB Invalid labels (values out of range). scenario=1, k=1000000, vertex=12, label=1750970
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 897 ms 944 KB Output is correct
2 Correct 720 ms 944 KB Output is correct
3 Correct 592 ms 944 KB Output is correct
4 Correct 3 ms 944 KB Output is correct
5 Correct 4 ms 736 KB Output is correct
6 Correct 2 ms 736 KB Output is correct
7 Correct 665 ms 864 KB Output is correct
8 Correct 882 ms 944 KB Output is correct
9 Correct 696 ms 944 KB Output is correct
10 Correct 570 ms 944 KB Output is correct
11 Correct 4 ms 944 KB Output is correct
12 Correct 5 ms 952 KB Output is correct
13 Correct 4 ms 736 KB Output is correct
14 Correct 4 ms 776 KB Output is correct
15 Correct 2 ms 952 KB Output is correct
16 Correct 593 ms 864 KB Output is correct
17 Correct 628 ms 944 KB Output is correct
18 Correct 541 ms 1108 KB Output is correct
19 Correct 625 ms 900 KB Output is correct
20 Correct 608 ms 944 KB Output is correct

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 729 ms 864 KB Wrong query response.
2 Halted 0 ms 0 KB -