oj.uz

답안 #305247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305247 2020-09-22T19:24:27 Z oscarsierra12 기지국 (IOI20_stations) C++14
0 / 100
 3000 ms 1280 KB 
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std ;

const int N = 1010 ;

int dfsNum[N];
int cnt = 0 ;
vector <int> G[N] ;

void dfs ( int u, int p, int f ) {
    if ( f ) dfsNum[u] = cnt++ ;
    for ( auto v:G[u] ) if ( v!=p ) dfs (v, u, 1-f) ;
    if ( !f ) dfsNum[u] = cnt++ ;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	for ( int i = 0 ; i < n ; ++i ) G[i].clear() ;
	cnt = 0 ;
	for ( int i = 0 ; i + 1 < n ; ++i ) {
        G[u[i]].push_back ( v[i] ) ;
        G[v[i]].push_back ( u[i] ) ;
	}
    dfs ( 0, -1, 0 ) ;
	for (int i = 0; i < n; i++) {
		labels[i] = dfsNum[i];
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    sort ( c.begin(), c.end() ) ;
    if ( c[0] > s ) {
        ///s is timein
        if ( t < s ) return c.back() ;
        for ( auto i:c )
            if ( i >= t ) return i ;
        while(1){};
    }
    ///s is timeout
    if ( s < t ) return c[0] ;
    for ( int i = 1 ; i < c.size() ; ++i )
        if ( c[i] > t ) return c[i-1] ;
	return c[0];
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:45:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for ( int i = 1 ; i < c.size() ; ++i )
      |                       ~~^~~~~~~~~~
stations.cpp:45:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   45 |     for ( int i = 1 ; i < c.size() ; ++i )
      |     ^~~
stations.cpp:47:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   47 |  return c[0];
      |  ^~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

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