oj.uz

Submission #956843

# Submission time Handle Problem Language Result Execution time Memory
956843 2024-04-02T14:27:47 Z 12345678 Stations (IOI20_stations) C++17
76 / 100
 615 ms 2076 KB 
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=2e3+5;
int in[nx], out[nx], lvl[nx], cnt, pa, t1;
vector<int> res, d[nx];
vector<pair<int, int>> mp[nx];

void dfs(int u, int p)
{
    in[u]=++cnt;
    lvl[u]=lvl[p]+1;
    for (auto v:d[u]) if (v!=p) dfs(v, u);
    out[u]=++cnt;
    if (lvl[u]%2) mp[in[u]].push_back({u, 0});
    else mp[out[u]].push_back({u, 1});
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    cnt=-1;
    t1=0;
    for (int i=0; i<n; i++) d[i].clear();
    for (int i=0; i<2000; i++) mp[i].clear();
    res.resize(n);
    for (int i=0; i<n-1; i++) d[u[i]].push_back(v[i]), d[v[i]].push_back(u[i]);
    lvl[0]=0;
    dfs(0, 0);
    for (int i=0; i<2000; i++)
    {
        if (!mp[i].empty())
        {
            for (auto [x, y]:mp[i]) res[x]=t1+y*1000;
            t1++;
        }
    }
	return res;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if (c.size()==1) return c[0];
    if (t>=1000) t-=1000;
    if (s<1000)
    {
        for (auto &x:c) x-=1000;
        if (s==0) for (auto x:c) if (t<=x) return x+1000;
        pa=c.back();
        for (int i=0; i<c.size()-1; i++) if (s<=t&&t<=c[i]) return c[i]+1000;
        return pa+1000;
    }
    else
    {
        s-=1000;
        pa=c.front();
        for (int i=c.size()-1; i>0; i--) if (c[i]<=t&&t<=s) return c[i];
        return pa;
    }
}

Compilation message

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

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 708 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1007
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 656 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1511
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 1068 KB Output is correct
2 Correct 249 ms 1068 KB Output is correct
3 Correct 494 ms 940 KB Output is correct
4 Correct 402 ms 684 KB Output is correct
5 Correct 405 ms 684 KB Output is correct
6 Correct 295 ms 1064 KB Output is correct
7 Correct 277 ms 940 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 1 ms 764 KB Output is correct
11 Correct 424 ms 864 KB Output is correct
12 Correct 351 ms 1384 KB Output is correct
13 Correct 285 ms 2076 KB Output is correct
14 Correct 285 ms 940 KB Output is correct
15 Correct 27 ms 768 KB Output is correct
16 Correct 35 ms 1028 KB Output is correct
17 Correct 57 ms 1004 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 615 ms 684 KB Output is correct
2 Correct 371 ms 684 KB Output is correct
3 Correct 383 ms 684 KB Output is correct
4 Correct 1 ms 764 KB Output is correct
5 Correct 3 ms 772 KB Output is correct
6 Correct 0 ms 768 KB Output is correct
7 Correct 399 ms 684 KB Output is correct
8 Correct 590 ms 680 KB Output is correct
9 Correct 437 ms 684 KB Output is correct
10 Correct 449 ms 684 KB Output is correct
11 Correct 4 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 3 ms 768 KB Output is correct
15 Correct 1 ms 1020 KB Output is correct
16 Correct 334 ms 684 KB Output is correct
17 Correct 358 ms 864 KB Output is correct
18 Correct 311 ms 684 KB Output is correct
19 Correct 312 ms 684 KB Output is correct
20 Correct 315 ms 692 KB Output is correct

Subtask #5
50.0 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 386 ms 1068 KB Partially correct
2 Partially correct 340 ms 1048 KB Partially correct
3 Partially correct 604 ms 684 KB Partially correct
4 Partially correct 404 ms 684 KB Partially correct
5 Partially correct 373 ms 684 KB Partially correct
6 Partially correct 328 ms 1064 KB Partially correct
7 Partially correct 278 ms 940 KB Partially correct
8 Partially correct 1 ms 768 KB Partially correct
9 Partially correct 1 ms 764 KB Partially correct
10 Partially correct 1 ms 764 KB Partially correct
11 Partially correct 276 ms 1504 KB Partially correct
12 Partially correct 310 ms 944 KB Partially correct
13 Partially correct 607 ms 684 KB Partially correct
14 Partially correct 425 ms 684 KB Partially correct
15 Partially correct 399 ms 684 KB Partially correct
16 Partially correct 306 ms 940 KB Partially correct
17 Partially correct 378 ms 684 KB Partially correct
18 Partially correct 273 ms 1232 KB Partially correct
19 Partially correct 261 ms 1496 KB Partially correct
20 Partially correct 299 ms 940 KB Partially correct
21 Partially correct 32 ms 764 KB Partially correct
22 Partially correct 43 ms 1032 KB Partially correct
23 Partially correct 55 ms 1012 KB Partially correct
24 Partially correct 4 ms 768 KB Partially correct
25 Partially correct 2 ms 768 KB Partially correct
26 Partially correct 3 ms 764 KB Partially correct
27 Partially correct 2 ms 768 KB Partially correct
28 Partially correct 2 ms 764 KB Partially correct
29 Partially correct 324 ms 680 KB Partially correct
30 Partially correct 366 ms 684 KB Partially correct
31 Partially correct 327 ms 684 KB Partially correct
32 Partially correct 330 ms 684 KB Partially correct
33 Partially correct 292 ms 684 KB Partially correct
34 Partially correct 219 ms 1060 KB Partially correct
35 Partially correct 296 ms 1588 KB Partially correct
36 Partially correct 298 ms 1248 KB Partially correct
37 Partially correct 304 ms 1212 KB Partially correct
38 Partially correct 315 ms 1220 KB Partially correct
39 Partially correct 315 ms 1220 KB Partially correct
40 Partially correct 273 ms 1472 KB Partially correct
41 Partially correct 294 ms 1464 KB Partially correct
42 Partially correct 39 ms 960 KB Partially correct
43 Partially correct 68 ms 996 KB Partially correct
44 Partially correct 103 ms 1028 KB Partially correct
45 Partially correct 99 ms 1024 KB Partially correct
46 Partially correct 165 ms 976 KB Partially correct
47 Partially correct 212 ms 1024 KB Partially correct
48 Partially correct 44 ms 1552 KB Partially correct
49 Partially correct 34 ms 1896 KB Partially correct