oj.uz

답안 #1064774

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064774 2024-08-18T17:38:33 Z Osplei 기지국 (IOI20_stations) C++17
5 / 100
 679 ms 25284 KB 
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

vector <int> bfs (int n, int nodo, vector <int> grafo[1000005]){
  vector <int> aux(n);
  bool visto[1000005];
  queue <int> q;
  int pos = 0;

  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:39:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   for (int i = 0; i < u.size(); i++) {
      |                   ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 390 ms 25256 KB Output is correct
2 Correct 331 ms 25260 KB Output is correct
3 Correct 621 ms 25004 KB Output is correct
4 Correct 497 ms 25104 KB Output is correct
5 Correct 438 ms 25004 KB Output is correct
6 Correct 331 ms 25260 KB Output is correct
7 Correct 295 ms 25264 KB Output is correct
8 Correct 32 ms 25112 KB Output is correct
9 Correct 32 ms 25112 KB Output is correct
10 Correct 19 ms 25136 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 386 ms 25260 KB Output is correct
2 Correct 341 ms 25172 KB Output is correct
3 Correct 679 ms 25004 KB Output is correct
4 Correct 478 ms 25004 KB Output is correct
5 Correct 393 ms 25004 KB Output is correct
6 Correct 319 ms 25264 KB Output is correct
7 Correct 323 ms 25260 KB Output is correct
8 Correct 45 ms 25004 KB Output is correct
9 Correct 41 ms 25112 KB Output is correct
10 Correct 18 ms 25112 KB Output is correct
11 Incorrect 419 ms 25228 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 666 ms 25004 KB Output is correct
2 Correct 521 ms 25004 KB Output is correct
3 Correct 408 ms 25004 KB Output is correct
4 Correct 32 ms 25004 KB Output is correct
5 Correct 31 ms 25112 KB Output is correct
6 Correct 20 ms 25136 KB Output is correct
7 Incorrect 389 ms 25004 KB Wrong query response.
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 423 ms 25260 KB Output is correct
2 Correct 295 ms 25260 KB Output is correct
3 Correct 636 ms 25004 KB Output is correct
4 Correct 503 ms 25004 KB Output is correct
5 Correct 417 ms 25008 KB Output is correct
6 Correct 304 ms 25260 KB Output is correct
7 Correct 313 ms 25260 KB Output is correct
8 Correct 31 ms 25004 KB Output is correct
9 Correct 33 ms 25260 KB Output is correct
10 Correct 17 ms 25180 KB Output is correct
11 Incorrect 347 ms 25260 KB Wrong query response.
12 Halted 0 ms 0 KB -