oj.uz

Submission #1030870

# Submission time Handle Problem Language Result Execution time Memory
1030870 2024-07-22T11:05:27 Z Hectorungo_18 City Mapping (NOI18_citymapping) C++14
13 / 100
 4 ms 712 KB 
 #include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
 
 
const int N = 1e3+5;
vector<int> adj[N];
int v[N], r[N], w[N]; 
vector<pair<long long int, int>> dis(N, {1e18+7, 0});
int pos = 0;
 
 
 
void un(int a, int b, long long int dis){
    adj[a].push_back(b);
    // adj[b].push_back(a);
    v[pos]=a;
    r[pos]=b;
    w[pos]=dis;
    pos++;
}
 
 
void dfs(int u, int p, int ps, long long int pd){
    int st = dis[ps].second, dd = dis[ps].first;
	
    if(adj[u].size() == 0){
		long long int fd = get_distance(u, p);
        un(u, st, (int) fd);
        return;
    }
	else{
		dfs(adj[u][0], u, ps, pd);
		return;
	}
 
    if(adj[u].size() == 1){
        int x = adj[u][0];
        long long int d = get_distance(x, st);
        if(d < pd) dfs(x, u, ps, d);
        else{
            un(u, st, (int) pd);
            return;
        }
		return;
    }
 
    if(adj[u].size() == 2){
        int x = adj[u][0];
        long long int d = get_distance(x, st);
        
        if(d < pd) dfs(x, u, ps, d);
        else{
            long long int r = get_distance(adj[u][1], st);
            dfs(adj[u][1], u, ps, r);
        }
		return;
    }
 
    
 
}
 
 
void find_roads(int n, int q, int A[], int B[], int W[]) {
    // vector<pair<long long int, int>> dis (n-1);
	long long int mx;
	int mp;
	mx = -1;
  mp = -1;
    for(int i = 0; i < n-1; i++){
        long long int d = get_distance(1, i+2);
        // dis[i]={d, i+2};
		if(d > mx){
			mx = d;
			mp=i+2;
		}
    }
	int rr = 0;
	for(int i = 0; i < n; i++){
		if(i+1 != mp){
			long long int d = get_distance(mp, i+1);
			dis[i-rr]={d, i+1};
		}
		else rr=1;
	}
    sort(dis.begin(), dis.end());
 
    
    un(mp, dis[0].second, dis[0].first);
 
    for(int i = 1; i < n-1; i++){
        dfs(mp, -1, i, dis[i].first);
    }
 
    // for(int i = 0; i < n-1; i++){
    //     cout << v[i] << " " << r[i] << " " << w[i] << endl;
    // }
    //int aa[n-1], bb[n-1], cc[n-1];
 
 
    // for(int i = 0; i < n-1; i++){
    //     aa[i] = v[i];
    //     bb[i] = r[i];
    //     cc[i] = w[i];
    //     // cout << v[i] << " " << r[i] << " " << w[i] << endl;
    // }
    // A = aa;
    // B = bb;
    // W = cc;
 
	for (int i = 0; i < n - 1; i++) {
		A[i] = v[i];
		B[i] = r[i];
		W[i] = w[i];
		// cout << A[i] << " " << B[i] << " " << W[i] << endl;
	}
	return;
}

Compilation message

citymapping.cpp: In function 'void dfs(int, int, int, long long int)':
citymapping.cpp:25:30: warning: unused variable 'dd' [-Wunused-variable]
   25 |     int st = dis[ps].second, dd = dis[ps].first;
      |                              ^~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Correct: 2993 out of 500000 queries used.
2 Incorrect 3 ms 604 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Correct: 2993 out of 500000 queries used.
2 Incorrect 3 ms 604 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Correct: 2969 out of 12000 queries used.
2 Correct 3 ms 604 KB Correct: 2975 out of 12000 queries used.
3 Correct 3 ms 712 KB Correct: 2996 out of 12000 queries used.
4 Correct 4 ms 604 KB Correct: 2975 out of 12000 queries used.
5 Correct 3 ms 604 KB Correct: 2969 out of 12000 queries used.

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Correct: 2969 out of 12000 queries used.
2 Correct 3 ms 604 KB Correct: 2975 out of 12000 queries used.
3 Correct 3 ms 712 KB Correct: 2996 out of 12000 queries used.
4 Correct 4 ms 604 KB Correct: 2975 out of 12000 queries used.
5 Correct 3 ms 604 KB Correct: 2969 out of 12000 queries used.
6 Incorrect 3 ms 604 KB Reported list of edges differ from actual.
7 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Correct: 2993 out of 500000 queries used.
2 Incorrect 3 ms 604 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -