oj.uz

답안 #305286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305286 2020-09-22T22:08:55 Z abeker 기지국 (IOI20_stations) C++17
0 / 100
 1083 ms 1032 KB 
#include <bits/stdc++.h>
#include "stations.h"
using namespace std;

typedef pair <int, int> pii;

vector <int> label(int N, int K, vector <int> u, vector <int> v) {
  vector <vector <int>> adj(N);
  for (int i = 0; i < N - 1; i++) {
    adj[u[i]].push_back(v[i]);
    adj[v[i]].push_back(u[i]);
  }
  int timer = 0;
  vector <pii> sorted;
  vector <int> labels(N);
  function <void(int, int, int)> dfs = [&](int x, int p, int d) {
    int disc = timer++;
    for (auto it : adj[x])
      if (it != p)
        dfs(it, x, d ^ 1);
    int fin = timer++;
    sorted.push_back({d ? fin : disc, x});
  };   
  dfs(0, -1, 0);
  sort(sorted.begin(), sorted.end());
  for (int i = 0; i < N; i++)
    labels[sorted[i].second] = i;
  return labels;
}

int find_next_station(int start, int dest, vector <int> neigh) { 
  sort(neigh.begin(), neigh.end());
  if (start && start < neigh[0]) {
    int parent = neigh.back();
    neigh.insert(neigh.begin(), start);
    neigh.pop_back();
    for (int i = 1; i < neigh.size(); i++)
      if (dest > neigh[i - 1] && dest <= neigh[i])
        return neigh[i - 1];
    return parent;
  }
  else {
    int parent = neigh[0];
    if (start) {  
      neigh.erase(neigh.begin());
      neigh.push_back(start);
    }
    for (int i = 1; i < neigh.size(); i++)
      if (dest >= neigh[i - 1] && dest < neigh[i])
        return neigh[i - 1];
    return parent;
  }	
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:37:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for (int i = 1; i < neigh.size(); i++)
      |                     ~~^~~~~~~~~~~~~~
stations.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 1; i < neigh.size(); i++)
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

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