oj.uz

Submission #430716

# Submission time Handle Problem Language Result Execution time Memory
430716 2021-06-17T02:26:02 Z JUANDI321 Stations (IOI20_stations) C++17
0 / 100
 923 ms 848 KB 
#include "stations.h"
#include <vector>
#include <iostream>

using namespace std;
vector<vector<int>> g(1000+10);
vector<int> l(1000 +10);
bool ch[1010];

void dfs(int node, int& i)
{
  if(ch[node])return;
  ch[node]=true;
  l[i] = node;
  //cout<<node<<endl;
  for(auto y : g[node])
  {
    if(!ch[y])
    {
      i++;
      dfs(y, i);
    }
  }
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
  vector<int> labels(n);
  
  for(int i = 0; i < n-1; i++)
  {
    g[u[i]].push_back(v[i]);
    g[v[i]].push_back(u[i]);
  }
  int spn = 0;
  for(int i = 0; i < n; i++)
  {
    if(g[i].size() == 1)
    {
      spn = i;
      break;
    }
  }
  
  int pos = 0;

  dfs(spn, pos);//cout<<"hola"<<endl;
  for (int i = 0; i < n; i++) {
    labels[l[i]] = i;
    //cout<<"l[i] "<<l[i]<<" i "<<i<<endl;
  }
  return labels;
}

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

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 584 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 564 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 848 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 923 ms 400 KB Output is correct
2 Incorrect 617 ms 400 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 668 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -