oj.uz

답안 #314302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314302 2020-10-19T15:08:59 Z DanerZein 기지국 (IOI20_stations) C++14
10 / 100
 999 ms 1028 KB 
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
vector<int> labels;
vector<vi> G;
int in[1010],out[1010];
int it=0;
void dfs(int u){
  it++;
  in[u]=it;
  for(auto &v:G[u]){
    if(!in[v]){
      dfs(v);
    }
  }
  it++;
  out[u]=it;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
  labels.assign(n,-1);
  G.clear();
  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);
  }
  memset(in,0,sizeof in);
  memset(out,0,sizeof out);
  dfs(0);
  for(int i=0;i<n;i++){
    int la=in[i]*1000;
    la+=out[i];
    // cout<<in[i]<<" "<<out[i]<<" "<<la<<endl;
    labels[i]=la;
  }
  return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
  int ro=-1,rp=-1;
  int si,ti,so,to;
  si=s/1000; so=s%1000;
  ti=t/1000; to=t%1000;
  bool sub=0;
  int ia,oa;
  for(int i=0;i<c.size();i++){
    ia=c[i]/1000; oa=c[i]%1000;
    if(si<ia && so>oa){
      if(ia<=ti && oa>=to){
	rp=c[i];
      }
    }
    else{
      ro=c[i];
    }
  }
  if(si<ti && so>to){
    //cout<<"hijo "<<rp<<endl;
    return rp;
  }
  else{
    //cout<<"padre "<<ro<<endl;
    return ro;
  }
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:52:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for(int i=0;i<c.size();i++){
      |               ~^~~~~~~~~
stations.cpp:50:8: warning: unused variable 'sub' [-Wunused-variable]
   50 |   bool sub=0;
      |        ^~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=0, label=1020
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=0, label=2992
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB Invalid labels (values out of range). scenario=1, k=1000000, vertex=12, label=1755975
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 999 ms 768 KB Output is correct
2 Correct 788 ms 892 KB Output is correct
3 Correct 632 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 2 ms 900 KB Output is correct
7 Correct 602 ms 888 KB Output is correct
8 Correct 962 ms 648 KB Output is correct
9 Correct 656 ms 640 KB Output is correct
10 Correct 663 ms 768 KB Output is correct
11 Correct 7 ms 900 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 4 ms 768 KB Output is correct
14 Correct 4 ms 768 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 628 ms 768 KB Output is correct
17 Correct 624 ms 776 KB Output is correct
18 Correct 612 ms 640 KB Output is correct
19 Correct 681 ms 1028 KB Output is correct
20 Correct 605 ms 1024 KB Output is correct

Subtask #5
0 / 61.0

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