oj.uz

Submission #312958

# Submission time Handle Problem Language Result Execution time Memory
312958 2020-10-14T20:16:22 Z DanerZein Stations (IOI20_stations) C++14
0 / 100
 1128 ms 828 KB 
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
  vector<int> labels;
  labels.assign(n,-1);
  // 13 points - task 3
  vector<vi>G;
  G.resize(n+1);
  int t=u.size();
  for(int i=0;i<t;i++){
    int x=u[i],y=v[i];
    G[x].push_back(y);
    G[y].push_back(x);
  }
  int id=-1;
  for(int i=0;i<n;i++){
    if(G[i].size()>1){
      id=i;
      break;
    }
  }
  int no=1;
  labels[id]=0;
  for(int i=0;i<n;i++){
    if(labels[i]==-1){
      labels[i]=no;
      no++;
    }
  }
  /*for(int i=0;i<n;i++) cout<<labels[i]<<" ";
  cout<<endl;
  cout<<id<<endl;*/
  // 8 points - taks 2
  /*for(int i=0;i<n;i++) labels[i]=i;*/
  // 5 points - task 1
  /*int no=0,id=-1;
  for(int i=0;i<n;i++){
    if(G[i].size()==1){
      id=i;
      break;
    }
  }
  queue<int> q;
  q.push(id);
  while(!q.empty()){
    int x=q.front();
    q.pop();
    labels[x]=no;
    no++;
    for(auto &v:G[x]){
      if(labels[v]==-1){
	q.push(v);
      }
    }
  }*/
  return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
  // 5 points - task 1
  /*  if(s>t)
    return s-1;
  return s+1;*/
  // 8 points - task 2
  /*queue<ii> q;
  q.push(ii(s*2+1,0));
  q.push(ii(s*2+2,1));
  int res=-1;
  while(!q.empty()){
    int x=q.front().first;
    int sw=q.front().second;
    if(x==t){
      res=sw;
      break;
    }
    q.pop();
    if(x*2+1<=t) q.push(ii(x*2+1,sw));
    if(x*2+2<=t) q.push(ii(x*2+2,sw));
  }
  if(res==-1){
    return c[0];
  }
  else{
    if(s==0){
      if(res==0) return c[0];
      return c[1];
    }
    if(res==0) return c[1];
    else return c[2];
  }*/
  // 16 points - task 3
  /*cout<<s<<" "<<t<<endl;
  for(int i=0;i<c.size();i++) cout<<c[i]<<" ";
  cout<<endl;*/
  if(s==0) return t;
  return c[0];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 532 ms 828 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 494 ms 756 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 595 ms 784 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1128 ms 648 KB Output is correct
2 Correct 717 ms 648 KB Output is correct
3 Incorrect 699 ms 640 KB Wrong query response.
4 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 594 ms 768 KB Wrong query response.
2 Halted 0 ms 0 KB -