oj.uz

Submission #732518

# Submission time Handle Problem Language Result Execution time Memory
732518 2023-04-29T05:14:06 Z Programmer123 Through Another Maze Darkly (CCO21_day1problem3) C++17
4 / 25
 9000 ms 11884 KB 
//Do initial DFSs to naively find first results.
//When return to root after N runs, all lasers should point to parent.
#include <bits/stdc++.h>
#define int long long int
#define init(x, s) x = new std::remove_pointer<decltype(x)>::type[s]
std::vector<int> traversal;
std::vector<int> *connections;
int *walkTime;
int *parent;
int *laserIndex;
bool *seen;
int traverse(int node) {
    walkTime[node] = 0;
    for (auto sub: connections[node]) {
        walkTime[node] += 2 + traverse(sub);
    }
    return walkTime[node];
}
int walk(int node, int steps) {
    if (steps == 0) return node;
    for (auto sub: connections[node]) {
        if (walkTime[sub] + 2 == steps) return node;
        if (walkTime[sub] + 2 <= steps) {
            steps -= walkTime[sub] + 2;
        } else {
            return walk(sub, steps - 1);
        }
    }
    assert(false);
}
signed main() {
    int N, Q;
    std::cin >> N >> Q;
    init(connections, N);
    init(walkTime, N);
    init(parent, N);
    init(laserIndex, N);
    init(seen, N);
    for (int i = 0; i < N; ++i) {
        seen[i] = false;
        laserIndex[i] = 0;
        int k;
        std::cin >> k;
        for (int j = 0; j < k; ++j) {
            int a;
            std::cin >> a;
            a--;
            connections[i].push_back(a);
        }
    }
    int answers[Q];
    typedef std::pair<int, int> qtp;//Value, index
    std::priority_queue<qtp, std::vector<qtp>, std::greater<>> queue;
    for (int i = 0; i < Q; ++i) {
        int x;
        std::cin >> x;
        queue.emplace(x, i);
    }
    int length = 0;
    int current = 0;
    int remaining = N;
    while ((current != 0 || remaining > 0) && !queue.empty()) {
        while ((!queue.empty()) && queue.top().first <= length) {
            answers[queue.top().second] = current;
            queue.pop();
        }
        if (!seen[current]) {
            seen[current] = true;
            remaining--;
        }
        laserIndex[current] = (laserIndex[current] + 1) % connections[current].size();
        //        traversal.push_back(current);
        current = connections[current][laserIndex[current]];
        length++;
    }
    if (!queue.empty()) {
        for (int i = 0; i < N; ++i) {
            std::vector<int> subtrees;
            int pIndex = laserIndex[i];
            for (int j = pIndex + 1; j < connections[i].size(); ++j) {
                subtrees.push_back(connections[i][j]);
            }
            for (int j = 0; j < pIndex; j++) {
                subtrees.push_back(connections[i][j]);
            }
            if (i == 0) subtrees.push_back(connections[i][laserIndex[i]]);
            connections[i] = subtrees;
        }
        traverse(0);
    }
    while (!queue.empty()) {
        int x = queue.top().first;
        int i = queue.top().second;
        queue.pop();
        std::cin >> x;
        x -= length;
        x = x % walkTime[0];
        answers[i] = walk(0, x);
    }
    for (int i = 0; i < Q; ++i) {
        std::cout << answers[i] + 1 << std::endl;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:80:40: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             for (int j = pIndex + 1; j < connections[i].size(); ++j) {
      |                                      ~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 501 ms 1896 KB Output is correct
3 Execution timed out 9092 ms 11884 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 312 KB Output is correct
3 Correct 8 ms 472 KB Output is correct
4 Correct 7 ms 564 KB Output is correct
5 Correct 6 ms 468 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 696 KB Output is correct
9 Correct 17 ms 548 KB Output is correct
10 Correct 27 ms 544 KB Output is correct
11 Correct 28 ms 536 KB Output is correct
12 Correct 40 ms 532 KB Output is correct
13 Correct 24 ms 548 KB Output is correct
14 Correct 5 ms 468 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1052 KB Output is correct
2 Correct 90 ms 4344 KB Output is correct
3 Execution timed out 9010 ms 8380 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 501 ms 1896 KB Output is correct
3 Execution timed out 9092 ms 11884 KB Time limit exceeded
4 Halted 0 ms 0 KB -