제출 #899067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
899067		GrindMachine	City Mapping (NOI18_citymapping)	C++17	25 / 100	35 ms	800 KiB

citymapping

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "citymapping.h"

void find_roads(int n, int q, int A[], int B[], int W[]) {
	vector<ll> dis(n+5);
	for(int i = 2; i <= n; ++i){
		dis[i] = get_distance(1,i);
	}

	vector<pll> order;
	rep1(i,n) order.pb({dis[i],i});

	sort(all(order));
	ll ptr = 0;

	rep1(i,n-1){
		ll u = order[i].ss;
		pll mn = {inf2,inf2};

		rep(j,i){
			// is v an ances of u?
			ll v = order[j].ss;
			ll d = 0;

			if(v == 1){
				d = dis[u];
			}
			else{
				d = get_distance(u,v);
			}

			if(dis[v]+d == dis[u]){
				pll px = {dis[u]-dis[v],v};
				amin(mn,px);
			}
		}

		auto [w,p] = mn;

		A[ptr] = p;
		B[ptr] = u;
		W[ptr] = w;
		ptr++;
	}
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 43