oj.uz

답안 #1080295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080295 2024-08-29T08:40:27 Z KaleemRazaSyed 기지국 (IOI20_stations) C++17
8 / 100
 670 ms 936 KB 
#include<bits/stdc++.h>
#include "stations.h"

using namespace std;

const int N = 1000;
vector<int> G[N];
int in[N], out[N];
int emit = 0;

void add_edge(int x, int y)
{
  G[x].push_back(y);
  G[y].push_back(x);
}

void dfs(int v, int p = -1)
{
  in[v] = emit++;
  for(int u : G[v])
    if(u != p)
      dfs(u, v);
  out[v] = emit;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
  /* emit = 0;
  for(int i = 0; i < n; i ++)
    G[i].clear();
  
  for(int i = 0; i < u.size(); i ++)
    add_edge(u[i], v[i]);

  for(int i = 0; i < N; i ++)
    if(G[i].size() == 1)
      {
	dfs(i);
	break;
      }
  */  
  vector<int> l(n);
  for(int i = 0; i < n; i ++)
    {
      l[i] = i; //  * N + out[i] - 1;
    } 
  return l;
}

int find_next_station(int s, int t, vector<int> c)
{
  if(t < s) return (s - 1) / 2;

  vector<int> path;
  while(t > 0)
    {
      // cerr << t << endl;
      path.push_back(t), t = (t - 1) / 2;
    }
  path.push_back(t);
  for(int i = 1; i < path.size(); i++)
    if(path[i] == s)
      return path[i - 1];
  return (s - 1) / 2;
    
    
    
  
  // int ins = s / N, outs = s % N + 1;
  // int in_t = t / N, outt = t % N + 1;
  /* if(s < t)
    return s + 1;
  return s - 1;
  */
  /*
  int p = -1;
  for(int i : c)
    {
      
      int ini = i / N, outi = i % N + 1;
      if(ini <= ins && outs <= outi)
	{
	  p = i;
	  continue;
	}
      
      if(ini <= in_t && outt <= outi)
	return i;
    }
  assert(p != -1);
  return p;
  */}

Compilation message

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

Subtask #1
0 / 5.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 352 ms 684 KB Output is correct
2 Correct 419 ms 684 KB Output is correct
3 Correct 670 ms 684 KB Output is correct
4 Correct 541 ms 936 KB Output is correct
5 Correct 425 ms 684 KB Output is correct
6 Correct 336 ms 684 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

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