oj.uz

답안 #1064812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064812 2024-08-18T18:03:53 Z Osplei 기지국 (IOI20_stations) C++17
0 / 100
 3000 ms 24236 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;
    }
  }

  */

  vector <int> labels;

  for (int i = 0; i < n; i++) labels.pb(i);

  return labels;
	
}

int find_next_station(int s, int t, vector <int> c) {

  if (c.size() == 1) return c[0];
	set <int> vecinos;

  for (auto i : c) vecinos.insert(i);

  if (t < s) return (s - 1) / 2;

  while (true) {
    if (vecinos.count(t) >= 1) return t;
    t = (t - 1) / 2;
  }
}

/*

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
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3073 ms 24236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3054 ms 24236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3070 ms 24236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 700 ms 24236 KB Output is correct
2 Incorrect 505 ms 24236 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3083 ms 24236 KB Time limit exceeded
2 Halted 0 ms 0 KB -