oj.uz

답안 #1074134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074134 2024-08-25T08:16:05 Z TheQuantiX 기지국 (IOI20_stations) C++17
0 / 100
 4 ms 600 KB 
#include <bits/stdc++.h>
#include "stations.h"

using namespace std;
using ll = long long;

ll n, m, q, k, x, y, a, b, c;
vector<ll> G[1000];

void dfs(ll x, ll p, ll depth, ll &timer, vector<int> &ans) {
    // cout << x << ' ' << p << ' ' << depth << ' ' << timer << endl;
    if (depth % 2 == 0) {
        ans[x] = timer;
    }
    timer++;
    for (int i : G[x]) {
        if (i != p) {
            dfs(i, x, depth + 1, timer, ans);
        }
    }
    if (depth % 2 == 1) {
        ans[x] = timer;
    }
    timer++;
}

vector<int> label(int N, int K, vector<int> u, vector<int> v) {
    n = N;
    k = K;
    for (int i = 0; i < 1000; i++) {
        G[i].clear();
    }
    for (int i = 0; i < u.size(); i++) {
        G[u[i]].push_back(v[i]);
        G[v[i]].push_back(u[i]);
    }
    vector<int> ans(n);
    ll timer = 0;
    dfs(0, -1, 0, timer, ans);
    set<ll> st;
    for (int i = 0; i < n; i++) {
        st.insert(ans[i]);
    }
    map<ll, ll> mp;
    ll cnt = 0;
    for (int i : st) {
        mp[i] = cnt++;
    }
    for (int i = 0; i < n; i++) {
        ans[i] = mp[i];
    }
    return ans;
}

int find_next_station(int s, int t, vector<int> c) {
    // cout << s << ' ' << t << '\n';
    // for (int i = 0; i < c.size(); i++) {
    //     cout << c[i] << ' ';
    // }
    // cout << '\n';
    if (s > c[c.size() - 1]) {
        for (int i = 1; i < c.size(); i++) {
            if (c[i] > t) {
                return c[i - 1];
            }
        }
        if (s > t) {
            return c[c.size() - 1];
        }
        return c[0];
    }
    if (s > t) {
        return c[c.size() - 1];
    }
    for (int i = 0; i < c.size() - 1; i++) {
        if (c[i] >= t) {
            return c[i];
        }
    }
    return c[c.size() - 1];
}

Compilation message

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 600 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 600 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 600 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 600 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -