oj.uz

답안 #1073789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073789 2024-08-24T21:11:20 Z Osplei 기지국 (IOI20_stations) C++17
0 / 100
 662 ms 25304 KB 
    #include "stations.h"
    #include <bits/stdc++.h>
     
    using namespace std;
     
    #define pb push_back

    int pos = 0;
     
    vector <int> bfs (int n, int nodo, vector <int> grafo[1000005]){
      vector <int> aux(n);
      bool visto[1000005];
      queue <int> q;
     
      for (int i = 0; i < 1000005; i++) visto[i] = false;
     
      q.push(nodo);
     
      while (!q.empty()){
        int act = q.front();
        q.pop();
     
        if (visto[act] == true) continue;
     
        visto[act] = true;
     
        for (auto i : grafo[act]) q.push(i);
     
        aux[act] = pos;
        pos++;
      }
     
      return aux; 
    }
     
    vector <int> label(int n, int k, vector <int> u, vector <int> v) {
    	
      vector <int> grafo[1000005];
     
      for (int i = 0; i < u.size(); i++) {
        int a = u[i], b = v[i];
     
        grafo[a].pb(b);
        grafo[b].pb(a);
      }
     
      for (int i = 0; i < n; i++){
        if (grafo[i].size() == 1){
          vector <int> labels = bfs(n, i, grafo);
          //for (auto j : labels) cout << j << " ";
          return labels;
        }
      }
     
      return u;
    	
    }
     
    int find_next_station(int s, int t, vector <int> c) {
     
      if (c.size() == 1) return c[0];
    	
      if (t > s) return max(c[0], c[1]);
      else return min(c[0], c[1]);
    }
     
    /*
     
    int main(){
      label(5, 10, {0, 3, 4, 2}, {1, 4, 0, 1});
    }
     
    */

Compilation message

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:40:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |       for (int i = 0; i < u.size(); i++) {
      |                       ~~^~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 399 ms 25260 KB Output is correct
2 Correct 320 ms 25260 KB Output is correct
3 Correct 662 ms 25004 KB Output is correct
4 Correct 469 ms 25004 KB Output is correct
5 Correct 451 ms 25004 KB Output is correct
6 Correct 339 ms 25260 KB Output is correct
7 Correct 312 ms 25260 KB Output is correct
8 Correct 39 ms 25008 KB Output is correct
9 Correct 38 ms 25304 KB Output is correct
10 Correct 22 ms 25112 KB Output is correct
11 Incorrect 470 ms 25004 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 651 ms 25004 KB Output is correct
2 Correct 492 ms 25004 KB Output is correct
3 Correct 453 ms 25004 KB Output is correct
4 Correct 33 ms 25004 KB Output is correct
5 Correct 33 ms 25112 KB Output is correct
6 Correct 21 ms 25128 KB Output is correct
7 Incorrect 459 ms 25008 KB Wrong query response.
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 388 ms 25260 KB Partially correct
2 Partially correct 345 ms 25264 KB Partially correct
3 Correct 649 ms 25004 KB Output is correct
4 Correct 438 ms 25004 KB Output is correct
5 Correct 474 ms 25000 KB Output is correct
6 Partially correct 330 ms 25260 KB Partially correct
7 Correct 314 ms 25260 KB Output is correct
8 Correct 43 ms 25004 KB Output is correct
9 Correct 38 ms 25112 KB Output is correct
10 Correct 23 ms 25112 KB Output is correct
11 Incorrect 370 ms 25260 KB Wrong query response.
12 Halted 0 ms 0 KB -