oj.uz

답안 #385629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385629 2021-04-04T16:18:46 Z Ahmadsm2005 기지국 (IOI20_stations) C++14
0 / 100
 3000 ms 2097156 KB 
#include<bits/stdc++.h>
#include "stations.h"
using namespace std;
int C;
vector<vector<int>>edges;
vector<int>labels;
void DFS(int v,int u=-1){
labels[v]=C;
C++;
for(int i=0;i<edges[v].size();i++)
if(edges[v][i]!=u)
DFS(edges[v][i],v);
}
vector<int>label(int n,int k,vector<int>u,vector<int>v){
labels.clear();
labels.resize(n);
edges.resize(n);
for(int i=0;i<n;i++){
edges[u[i]].push_back(v[i]),edges[v[i]].push_back(u[i]);
}
DFS(0);
C=0;
edges.clear();
return labels;
}
int find_next_station(int s, int t,vector<int>c){
if(s<t){
int L=0,R=c.size()-1,mid,BEST=INT_MIN;
while(L<=R){
mid=(L+R)/2;
if(c[mid]<=t)
L=mid+1,BEST=max(BEST,mid);
else
R=mid-1;
}
return c[BEST];
}
return c[0];
}

Compilation message

stations.cpp: In function 'void DFS(int, int)':
stations.cpp:10:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | for(int i=0;i<edges[v].size();i++)
      |             ~^~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1772 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3069 ms 161984 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1855 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1152 ms 652 KB Output is correct
2 Correct 773 ms 1056 KB Output is correct
3 Runtime error 2 ms 632 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1752 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -