Submission #541599

#	Time	Username	Problem	Language	Result	Execution time	Memory
541599		Vladth11	Stations (IOI20_stations)	C++14	0 / 100	729 ms	664 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <long double, pii> muchie;

const ll NMAX = 1001;
const ll VMAX = 1000001;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 1000000;
const ll nr_of_bits = 16;

vector <int> sol;
int lvl[NMAX];
vector <int> g[NMAX];
int stamp;

void DFS(int node, int p){
    lvl[node] = lvl[p] + 1;
    if(lvl[node] % 2){
        sol[node] = stamp++;
    }
    for(auto x : g[node]){
        if(x == p)
            continue;
        DFS(x, node);
    }
    if(lvl[node] % 2 == 0)
        sol[node] = stamp++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	sol.clear();
	sol.resize(n);
	stamp = 0;
	for(int i = 0; i < n; i++){
        g[i].clear();
        lvl[i] = 0;
	}
	for (int i = 0; i < n - 1; i++) {
        int a = u[i];
        int b = v[i];
        g[a].push_back(b);
        g[b].push_back(a);
	}
    DFS(0, -1);
    return sol;
}

int find_next_station(int s, int t, vector<int> c) {
    sort(c.begin(), c.end());
    if(s >= c[0])
        reverse(c.begin(), c.end());
    for(int i = 0; i < c.size(); i++){
        if(c[i] > s && s <= t && t <= c[i]){
            return c[i];
        }else if(c[i] < s && c[i] <= t && t <= s){
            return c[i];
        }
    }
    if(s < c[0]){ /// s e pe preodine
        return c.back();
    }
    return c[0];
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:59:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for(int i = 0; i < c.size(); i++){
      |                    ~~^~~~~~~~~~

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