oj.uz

Submission #307776

# Submission time Handle Problem Language Result Execution time Memory
307776 2020-09-29T09:54:39 Z Vimmer Stations (IOI20_stations) C++14
5 / 100
 1012 ms 5832 KB 
#include <bits/stdc++.h>
#include "stations.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define N 100005
#define PB push_back
#define sz(x) int(x.size())
#define F first
#define M ll(1e9 + 7)
#define S second
#define all(x) x.begin(), x.end()
#define endl '\n'

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
//typedef tree <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

ll mlt(ll x, ll y) {return (x * y) % M;}
ll sm(ll x, ll y) {return (x + y) % M;}


vector <int> g[N], a;

int id = 0;

void dfs(int v, int p)
{
    a[v] = id++;

    for (auto it : g[v])
    {
        if (it == p) continue;

        dfs(it, v);
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
    a.resize(n);

    id = 0;

    for (int i = 0; i < n - 1; i++)
    {
        g[u[i]].PB(v[i]);

        g[v[i]].PB(u[i]);
    }

    for (int i = 0; i < n; i++)
        if (sz(g[i]) == 1) {dfs(i, -1); break;}

    for (int i = 0; i < n; i++) g[i].clear();

	return a;
}

int find_next_station(int s, int t, vector<int> c)
{
    if (sz(c) == 1) return c[0];

    if (s < t) return max(c[0], c[1]);

    return min(c[0], c[1]);
}

//int main()
//{
//    iostream::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//
//    //freopen("fcolor.in", "r", stdin); freopen("fcolor.out", "w", stdout);
//
//
//}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 692 ms 5740 KB Output is correct
2 Correct 570 ms 5632 KB Output is correct
3 Correct 958 ms 5504 KB Output is correct
4 Correct 758 ms 5588 KB Output is correct
5 Correct 614 ms 5504 KB Output is correct
6 Correct 490 ms 5632 KB Output is correct
7 Correct 497 ms 5748 KB Output is correct
8 Correct 6 ms 5584 KB Output is correct
9 Correct 7 ms 5376 KB Output is correct
10 Correct 4 ms 5376 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 563 ms 5524 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 5632 KB Output is correct
2 Correct 584 ms 5724 KB Output is correct
3 Correct 1012 ms 5588 KB Output is correct
4 Correct 727 ms 5592 KB Output is correct
5 Correct 682 ms 5624 KB Output is correct
6 Correct 486 ms 5624 KB Output is correct
7 Correct 446 ms 5748 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 6 ms 5376 KB Output is correct
10 Correct 4 ms 5600 KB Output is correct
11 Incorrect 683 ms 5732 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 946 ms 5376 KB Output is correct
2 Correct 628 ms 5504 KB Output is correct
3 Correct 725 ms 5632 KB Output is correct
4 Correct 6 ms 5504 KB Output is correct
5 Correct 7 ms 5376 KB Output is correct
6 Correct 4 ms 5536 KB Output is correct
7 Incorrect 618 ms 5376 KB Wrong query response.
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 687 ms 5832 KB Output is correct
2 Correct 473 ms 5736 KB Output is correct
3 Correct 929 ms 5592 KB Output is correct
4 Correct 692 ms 5376 KB Output is correct
5 Correct 553 ms 5616 KB Output is correct
6 Correct 532 ms 5760 KB Output is correct
7 Correct 547 ms 5632 KB Output is correct
8 Correct 6 ms 5720 KB Output is correct
9 Correct 7 ms 5504 KB Output is correct
10 Correct 4 ms 5584 KB Output is correct
11 Incorrect 470 ms 5376 KB Wrong query response.
12 Halted 0 ms 0 KB -