oj.uz

답안 #674897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674897 2022-12-26T13:30:25 Z QwertyPi City Mapping (NOI18_citymapping) C++14
0 / 100
 30 ms 14388 KB 
#include "citymapping.h"

#include <bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct edge{
	int u, v, w;
};
vector<edge> E;

const int MAXN = 1e3 + 11;
bool done[MAXN];
void solve(vector<int> v, vector<long long> d = {}, int pa = -1){
	if(v.size() == 1) return;
	for(auto i : v) done[i] = false;
	int rt;
	if(d.empty()){
		d.resize(MAXN);
		int id = rng() % v.size();
		rt = v[id]; d[rt] = 0; done[rt] = true;
		for(auto i : v){
			if(i != rt) d[i] = get_distance(rt, i);
		}
	}else{
		rt = pa;
		done[rt] = true;
	}
	for(int tr = 0; tr < 3; tr++){
		int ch = -1;
		for(auto i : v){
			if(!done[i] && (ch == -1 || d[ch] > d[i])) ch = i;
		}
		if(ch == -1) break; done[ch] = true; 
		E.push_back({rt, ch, d[ch]});
		vector<long long> d2(MAXN);
		vector<int> sub_tree {ch};
		for(auto i : v){
			if(!done[i] && i != ch) {
				if(tr < 1) d2[i] = get_distance(ch, i);
				if(d2[i] <= d[i]) sub_tree.push_back(i), done[i] = true;
			}
		}
		vector<long long> nd(MAXN);
		for(auto i : v){
			nd[i] = d[i] - d[ch];
		}
		solve(sub_tree, nd, ch);
	}
}

void find_roads(int N, int Q, int A[], int B[], int W[]) {
	vector<int> v;
	for(int i = 1; i <= N; i++){
		v.push_back(i);
	}
	solve(v);
	for(int i = 0; i < E.size(); i++){
		A[i] = E[i].u, B[i] = E[i].v, W[i] = E[i].w;
	}
	return;
}

Compilation message

citymapping.cpp: In function 'void solve(std::vector<int>, std::vector<long long int>, int)':
citymapping.cpp:36:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   36 |   if(ch == -1) break; done[ch] = true;
      |   ^~
citymapping.cpp:36:23: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   36 |   if(ch == -1) break; done[ch] = true;
      |                       ^~~~
citymapping.cpp:37:30: warning: narrowing conversion of 'd.std::vector<long long int>::operator[](((std::vector<long long int>::size_type)ch))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
   37 |   E.push_back({rt, ch, d[ch]});
      |                              ^
citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:60:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |  for(int i = 0; i < E.size(); i++){
      |                 ~~^~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 14388 KB Correct: 250230 out of 500000 queries used.
2 Correct 30 ms 14224 KB Correct: 236508 out of 500000 queries used.
3 Correct 4 ms 1188 KB Correct: 15624 out of 500000 queries used.
4 Incorrect 4 ms 836 KB Reported list of edges differ from actual.
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 14388 KB Correct: 250230 out of 500000 queries used.
2 Correct 30 ms 14224 KB Correct: 236508 out of 500000 queries used.
3 Correct 4 ms 1188 KB Correct: 15624 out of 500000 queries used.
4 Incorrect 4 ms 836 KB Reported list of edges differ from actual.
5 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 852 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 852 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 14388 KB Correct: 250230 out of 500000 queries used.
2 Correct 30 ms 14224 KB Correct: 236508 out of 500000 queries used.
3 Correct 4 ms 1188 KB Correct: 15624 out of 500000 queries used.
4 Incorrect 4 ms 836 KB Reported list of edges differ from actual.
5 Halted 0 ms 0 KB -