Submission #1061871

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1061871	2024-08-16 14:36:18	RecursiveCo	Sky Walking (IOI19_walk)	C++17	57 / 100	3450 ms	320060 KiB

walk

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "walk.h"
using namespace std;
long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
    int n = x.size(); // = h.size()
    int m = l.size(); // = r.size() = y.size()
    
        // s and g can be anything, but n and m are small anyway so it doesn't matter.
        // or I suppose also with small numbers of intersections.
        vector<pair<int, int>> sorted;
        for (int i = 0; i < m; i++) {
            sorted.push_back({y[i], i});
        }
        sort(sorted.rbegin(), sorted.rend());
        int maxi = -1;
        map<pair<int, int>, vector<array<int, 3>>> adjList;
        vector<vector<int>> pts(n);
        set<int> tall;
        int ptr1 = 0;
        vector<pair<int, int>> buildings;
        for (int i = 0; i < n; i++) {
            buildings.push_back({h[i], i});
        }
        sort(buildings.rbegin(), buildings.rend());
        for (int k = 0; k < m; k++) {
            int yc = sorted[k].first;
            int i = sorted[k].second;
            while (ptr1 < n && buildings[ptr1].first >= yc) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 18 / 18
• Subtask 5: 0 / 43