oj.uz

답안 #432396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432396 2021-06-18T09:10:41 Z idk321 기지국 (IOI20_stations) C++17
76 / 100
 946 ms 940 KB 
#include "stations.h"
#include <vector>

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

const int M = 1000000000;
const int N = 1000;
int in[N];
int out[N];
vector<int> adj[N];
vector<int> labels;

int n, k;

int timer;

int type[N];


void dfs2(int node, int par)
{
    if (par == -1)
    {
        type[node] = 0;

    } else
    {
        type[node] = !type[par];

    }


    in[node] = timer;
    timer++;

    for (int next : adj[node])
    {
        if (next == par) continue;
        dfs2(next, node);
    }

    out[node] = timer;
    timer++;
}


const int add = 1000;


std::vector<int> label(int n1, int k1, std::vector<int> u, std::vector<int> v) {
    n = n1;
    k = k1;

    labels.assign(n, 0);


    for (int i = 0; i < n; i++) adj[i].clear();
    for (int i = 0; i < u.size(); i++)
    {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }




    timer = 0;
    dfs2(0, -1);



    for (int i = 0; i < n; i++) {
        if (type[i] == 0) labels[i] = in[i];
        else labels[i] = out[i];
    }
    vector<int> numbers;
    for (int i : labels) numbers.push_back(i);
    sort(numbers.begin(), numbers.end());
    map<int, int> turnTo;
    int cur = 0;
    for (int i : numbers)
    {
        turnTo[i] = cur;
        cur++;
    }

    for (int i = 0; i < labels.size(); i++)
    {
        labels[i] = turnTo[labels[i]];
    }
    for (int i = 0;  i< labels.size(); i++)
    {
        if (type[i] == 0) labels[i] += add;
    }

    return labels;
}



int find_next_station(int s, int t, std::vector<int> c) {
    if (t >= add) t -= add;
    if (s >= add)
    {
        s -= add;
        int par = -1;
        if (s != 0)
        {
            for (int next : c)
            {
                if (par < next)
                {
                    par = next;
                }
            }
        }


        if (t < s) return par;

        int take = M;
        for (int next : c)
        {
            if (next == par) continue;
            if (next < take && next >= t)
            {
                take = next;
            }

        }
        if (take == M) return par;
        return take;
    } else
    {
        int par = M;
        for (int& next : c)
        {

            next -= add;
            if (next < par) par = next;
        }


        if (t > s) return par + add;
        vector<int> children;
        for (int next : c)
        {
            if (next == par) continue;
            children.push_back(next);
        }


        if (t <= par) return par + add;

        int take = -1;
        for (int i = 0; i < children.size(); i++)
        {
            if (children[i] > t) break;
            take = i;
        }

        if (take == -1) return par + add;
        return children[take] + add;
    }






    return c[0];
}

Compilation message

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:59:23: 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 < u.size(); i++)
      |                     ~~^~~~~~~~~~
stations.cpp:88:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int i = 0; i < labels.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
stations.cpp:92:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     for (int i = 0;  i< labels.size(); i++)
      |                      ~^~~~~~~~~~~~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:157:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |         for (int i = 0; i < children.size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 476 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=2, label=1002
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 416 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=3, label=1001
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 559 ms 648 KB Output is correct
2 Correct 470 ms 800 KB Output is correct
3 Correct 946 ms 496 KB Output is correct
4 Correct 708 ms 652 KB Output is correct
5 Correct 628 ms 708 KB Output is correct
6 Correct 478 ms 940 KB Output is correct
7 Correct 480 ms 772 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 594 ms 648 KB Output is correct
12 Correct 504 ms 880 KB Output is correct
13 Correct 487 ms 752 KB Output is correct
14 Correct 501 ms 528 KB Output is correct
15 Correct 69 ms 544 KB Output is correct
16 Correct 86 ms 764 KB Output is correct
17 Correct 118 ms 680 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 837 ms 512 KB Output is correct
2 Correct 713 ms 508 KB Output is correct
3 Correct 609 ms 516 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 609 ms 400 KB Output is correct
8 Correct 891 ms 700 KB Output is correct
9 Correct 710 ms 512 KB Output is correct
10 Correct 621 ms 508 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 7 ms 596 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 3 ms 916 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 542 ms 400 KB Output is correct
17 Correct 546 ms 592 KB Output is correct
18 Correct 552 ms 528 KB Output is correct
19 Correct 487 ms 520 KB Output is correct
20 Correct 509 ms 512 KB Output is correct

Subtask #5
50.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 559 ms 728 KB Partially correct
2 Partially correct 503 ms 728 KB Partially correct
3 Correct 889 ms 400 KB Output is correct
4 Partially correct 652 ms 708 KB Partially correct
5 Partially correct 660 ms 508 KB Partially correct
6 Partially correct 510 ms 640 KB Partially correct
7 Partially correct 450 ms 860 KB Partially correct
8 Partially correct 2 ms 468 KB Partially correct
9 Partially correct 6 ms 652 KB Partially correct
10 Partially correct 2 ms 464 KB Partially correct
11 Partially correct 434 ms 520 KB Partially correct
12 Partially correct 537 ms 644 KB Partially correct
13 Correct 849 ms 596 KB Output is correct
14 Correct 668 ms 656 KB Output is correct
15 Partially correct 638 ms 528 KB Partially correct
16 Partially correct 442 ms 732 KB Partially correct
17 Partially correct 553 ms 516 KB Partially correct
18 Partially correct 466 ms 884 KB Partially correct
19 Partially correct 482 ms 660 KB Partially correct
20 Partially correct 426 ms 500 KB Partially correct
21 Partially correct 61 ms 724 KB Partially correct
22 Partially correct 80 ms 684 KB Partially correct
23 Partially correct 114 ms 656 KB Partially correct
24 Partially correct 6 ms 732 KB Partially correct
25 Partially correct 6 ms 468 KB Partially correct
26 Partially correct 4 ms 596 KB Partially correct
27 Partially correct 4 ms 596 KB Partially correct
28 Partially correct 2 ms 724 KB Partially correct
29 Partially correct 530 ms 536 KB Partially correct
30 Partially correct 491 ms 528 KB Partially correct
31 Partially correct 468 ms 528 KB Partially correct
32 Partially correct 513 ms 528 KB Partially correct
33 Partially correct 557 ms 400 KB Partially correct
34 Partially correct 325 ms 644 KB Partially correct
35 Partially correct 449 ms 764 KB Partially correct
36 Partially correct 450 ms 768 KB Partially correct
37 Partially correct 429 ms 776 KB Partially correct
38 Partially correct 453 ms 760 KB Partially correct
39 Partially correct 423 ms 768 KB Partially correct
40 Partially correct 452 ms 748 KB Partially correct
41 Partially correct 477 ms 888 KB Partially correct
42 Partially correct 73 ms 656 KB Partially correct
43 Partially correct 117 ms 772 KB Partially correct
44 Partially correct 138 ms 640 KB Partially correct
45 Partially correct 162 ms 660 KB Partially correct
46 Partially correct 322 ms 828 KB Partially correct
47 Partially correct 299 ms 764 KB Partially correct
48 Partially correct 63 ms 808 KB Partially correct
49 Partially correct 64 ms 784 KB Partially correct