Submission #853466

#	Time	Username	Problem	Language	Result	Execution time	Memory
853466		nnin	Stations (IOI20_stations)	C++14	0 / 100	571 ms	900 KiB

stations

#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;

vector<int> adj[1005], tmp;
int times;

void dfs(int u, int p, int ct) {
    tmp[u] = ct;
    for(int n:adj[u]) {
        if(n==p) continue;
        dfs(n, u, ct+times);
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	tmp.clear();
	tmp.resize(n);
	for(int i=0;i<n;i++) adj[i].clear();
	for(int i=0;i<n-1;i++) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
	}
	int root = 0;
	for(int i=0;i<n;i++) {
        if(adj[i].size()>2) {
            root = i;
            break;
        }
	}
	tmp[root] = 0;
	times = adj[root].size();
	for(int i=0;i<adj[root].size();i++) {
        dfs(adj[root][i], root, i+1);
	}
	/*for(int i=0;i<n;i++) labels[i] = i;
	/*
	for(int i=0;i<n;i++) {
        if(adj[i].size()==1) {
            dfs(i, i, 0);
            break;
        }
	}*/
	for(int i=0;i<n;i++) labels[i] = tmp[i];
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if(s==0) {
        int ret = t%c.size();
        if(ret==0) ret += c.size();
        return ret;
    }
    int num = abs(s-c[0]);
    if(s%num != t%num || t<s) {
        return s-num;
    }
    return s+num;
	/*if(t>s) return s+1;
    return s-1;
    while((t-1)/2>s) {
        t = (t-1)/2;
    }
    if((t-1)/2==s) return t;
    return (s-1)/2;*/
}

Compilation message (stderr)

stations.cpp:39:2: warning: "/*" within comment [-Wcomment]
   39 |  /*
      |   
stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:35:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for(int i=0;i<adj[root].size();i++) {
      |              ~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61