oj.uz

답안 #733921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733921 2023-05-01T12:01:06 Z vjudge1 City Mapping (NOI18_citymapping) C++17
9 / 100
 27 ms 468 KB 
#include "citymapping.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
    out << c.first << ' ' << c.second;
    return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
    const int sz = v.size();
    for (int i = 0; i < sz; i++) {
        if (i) out << ' ';
        out << v[i];
    }
    return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
    for (T &x : v) in >> x;
    return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

void find_roads(int n, int Q, int A[], int B[], int W[]) {
	queue<pair<int, vector<int>>> q;
	vector<ll> dis(n + 1, 0);
	vector<int> tmp;

	auto get = [&](int x, int y) -> ll {
		return get_distance(x, y);
	};

	for(int i = 2; i <= n; i++) {
		dis[i] = get(1, i);
		tmp.pb(i);
	}
	q.push({1, tmp});
	int cnt = 0;

	auto add = [&](int a, int b, int w) -> void {
		A[cnt] = a;
		B[cnt] = b;
		W[cnt++] = w;
	};

	while(q.size()) {
		int x = q.front().ff;
		tmp = q.front().ss;
		q.pop();
		sort(all(tmp), [&](int xx, int yy) -> bool {
			return dis[xx] < dis[yy];
		});
		vector<pair<int, vector<int>>> c;
		for(int y : tmp) {
			if(c.size() == 0) {c.pb({y, vector<int>()}); add(x, y, dis[y] - dis[x]);}
			else {
				bool did = 0;
				// for(auto &it : c) {
				// 	if(dis[y] + dis[it.ff] - dis[x] * 2 - (dis[it.ff] - dis[x]) * 2 == dis[y] - dis[it.ff]) {
				// 		add(it.ff, y, dis[y] - dis[it.ff]);
				// 		did = 1;
				// 		break;
				// 	}
				// }
				if(!did) {
					int mn = dis[y] - dis[x];
					int par = x;
					int cnt = 0, id = -1;
					for(auto &it : c) {
						int val = get(y, it.ff);
						if(val < mn) {
							mn = val;
							par = it.ff;
							id = cnt;
						}
						cnt++;
					}
					if(par == x) {
						add(x, y, mn);
						c.pb({y, vector<int>()});
					} else {
						c[id].ss.pb(y);
					}
				}
			}
		}
		while(c.size()) {
			q.push(c.back());
			c.pop_back();
		}
	}
	// assert(cnt == n - 1);
	return;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 468 KB Correct: 251941 out of 500000 queries used.
2 Correct 27 ms 468 KB Correct: 398952 out of 500000 queries used.
3 Correct 3 ms 460 KB Correct: 32585 out of 500000 queries used.
4 Correct 3 ms 464 KB Correct: 28235 out of 500000 queries used.
5 Correct 3 ms 468 KB Correct: 48126 out of 500000 queries used.

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 468 KB Correct: 251941 out of 500000 queries used.
2 Correct 27 ms 468 KB Correct: 398952 out of 500000 queries used.
3 Correct 3 ms 460 KB Correct: 32585 out of 500000 queries used.
4 Correct 3 ms 464 KB Correct: 28235 out of 500000 queries used.
5 Correct 3 ms 468 KB Correct: 48126 out of 500000 queries used.
6 Incorrect 10 ms 468 KB Reported list of edges differ from actual.
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 468 KB Correct: 251941 out of 500000 queries used.
2 Correct 27 ms 468 KB Correct: 398952 out of 500000 queries used.
3 Correct 3 ms 460 KB Correct: 32585 out of 500000 queries used.
4 Correct 3 ms 464 KB Correct: 28235 out of 500000 queries used.
5 Correct 3 ms 468 KB Correct: 48126 out of 500000 queries used.
6 Incorrect 10 ms 468 KB Reported list of edges differ from actual.
7 Halted 0 ms 0 KB -