oj.uz

Submission #719913

# Submission time Handle Problem Language Result Execution time Memory
719913 2023-04-07T04:26:37 Z joelgun14 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 69788 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define mp make_pair
#define fi first
#define lb lower_bound
#define se second
#define endl "\n"
using namespace std;
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m;
    cin >> n >> m;
    int blk = 50;
    vector<int> weights[n];
    int init = -1, initp = -1, target = -1;
    map<pair<int, int>, int> pti;
    set<int> s[(int)1e5];
    int t = 0;
    for(int i = 1; i <= blk; ++i) {
        for(int j = 0; j < i; ++j)
            pti[mp(j, i)] = t++;
    }
    bool done[n];
    memset(done, 0, sizeof(done));
    for(int i = 1; i <= m; ++i) {
        int b, p;
        cin >> b >> p;
        if(i == 1)
            init = b, initp = p;
        else if(i == 2)
            target = b;
        // b -> pos
        // p -> multiple
        weights[b].push_back(p);
        if(!done[b]) {
            for(int j = 1; j <= blk; ++j) {
                //cout << "INSERT " << b % j << " " << j << " " << b << endl;
                s[pti[mp(b % j, j)]].insert(b);
            }
            done[b] = 1;
        }
    }
    // gaperlu cek semua cukup cek yg ada weights
    // kalo udh proc weight jg gperlu
    // kalo <= blk maka memo tiap pair int modulo dalam vector
    // kalo > blk maka cek manual
    // doge cmn boleh gerak dr ori node (gaboleh meet di tengah)
    // hence cukup dijkstra dengan 1 origin, terus klo intersect lainnya bs langsung dijkstra aja
    // tiap node ada theoretically n^2 dijkstra state yg mgkn?
    // tp yg high modulo itu sparse, jadi bs simpan manual pakai sorted vector/semacamnya
    priority_queue<pair<int, pair<int, pair<int, int>>>, vector<pair<int, pair<int, pair<int, int>>>>, greater<pair<int, pair<int, pair<int, int>>>>> pq;
    // fi -> dist
    // se.fi -> idx
    // se.se.fi -> current p
    // se.se.se -> tanda dr atas/bawah
    // guna -> reduce double counting
    //cout << init << " " << initp << endl;
    pq.push(mp(0, mp(init, mp(initp, -1))));
    int d[n + 1];
    unordered_map<int, bool, custom_hash> vis[n];
    memset(d, -1, sizeof(d));
    // cek ada yg bs sampai ke target atau tidak, kalo tidak langsung output false
    // kalo iya, maka ada pembuktian min path tidak sepanjang itu?
    while(pq.size()) {
        int dist = pq.top().fi, idx = pq.top().se.fi, curp = pq.top().se.se.fi, tanda = pq.top().se.se.se;
        pq.pop();
        //cout << dist << " " << idx << " " << curp << endl;
        if(vis[idx][curp])
            continue;
        if(d[idx] == -1)
            d[idx] = dist;
        d[idx] = min(d[idx], dist);
        for(auto i : weights[idx]) {
            if(!vis[idx][i] && i != curp) {
                if(i > blk) {
                    int tmp = idx + i;
                    while(tmp < n && !weights[tmp].size())
                        tmp += i;
                    if(tmp < n && !vis[tmp][i])
                        pq.push(mp(dist + (tmp - idx) / i, mp(tmp, mp(i, 0))));
                    tmp = idx - i;
                    while(tmp >= 0 && !weights[tmp].size())
                        tmp -= i;
                    if(tmp >= 0 && !vis[tmp][i]) 
                        pq.push(mp(dist + (idx - tmp) / i, mp(tmp, mp(i, 1))));
                }
                else {
                    int mres = idx % i;
                    int x = pti[mp(mres, i)];
                    int nxtidx = -1, pridx = -1;
                    while(s[x].size() && s[x].lb(idx) != s[x].end()) {
                        int tmp = *s[x].lb(idx);
                        //cout << "FIND NXT " << tmp << " " << weights[tmp].size() << endl;
                        if(weights[tmp].size() && tmp != idx) {
                            nxtidx = tmp;
                            break;
                        }
                        s[x].erase(s[x].lb(idx));
                    }
                    while(s[x].size() && s[x].lb(idx) != s[x].begin()) {
                        int tmp = *--s[x].lb(idx);
                        if(weights[tmp].size() && tmp != idx) {
                            pridx = tmp;
                            break;
                        }
                        s[x].erase(--s[x].lb(idx));
                    }
                    //cout << nxtidx << " " <<pridx << endl;
                    if(nxtidx != -1 && !vis[nxtidx][i]) {
                        pq.push(mp(dist + (nxtidx - idx) / i, mp(nxtidx, mp(i, 0))));
                    }
                    if(pridx != -1 && !vis[pridx][i]) {
                        pq.push(mp(dist + (idx - pridx) / i, mp(pridx, mp(i, 1))));
                    }
                }
                vis[idx][i] = 1;
            }
        }
        weights[idx].clear();
        //cout << idx << " " << curp << endl;
        if(!vis[idx][curp]) {
            vis[idx][curp] = 1;
            //cout << dist << " " << idx << " " << curp << endl;
            if(curp > blk) {
                int tmp = idx + curp;
                if(tanda != 1) {
                    while(tmp < n && !weights[tmp].size())
                        tmp += curp;
                    if(tmp < n && !vis[tmp][curp])
                        pq.push(mp(dist + (tmp - idx) / curp, mp(tmp, mp(curp, 0))));
                }
                if(tanda != 0) {
                    tmp = idx - curp;
                    while(tmp >= 0 && !weights[tmp].size())
                        tmp -= curp;
                    if(tmp >= 0 && !vis[tmp][curp]) 
                        pq.push(mp(dist + (idx - tmp) / curp, mp(tmp, mp(curp, 1))));
                }
            }
            else {
                int mres = idx % curp;
                int x = pti[mp(mres, curp)];
                int nxtidx = -1, pridx = -1;
                while(s[x].size() && s[x].lb(idx) != s[x].end()) {
                    int tmp = *s[x].lb(idx);
                    if(weights[tmp].size() && tmp != idx) {
                        nxtidx = tmp;
                        break;
                    }
                    s[x].erase(s[x].lb(idx));
                }
                while(s[x].size() && s[x].lb(idx) != s[x].begin()) {
                    int tmp = *--s[x].lb(idx);
                    if(weights[tmp].size() && tmp != idx) {
                        pridx = tmp;
                        break;
                    }
                    s[x].erase(--s[x].lb(idx));
                }
                //cout << nxtidx << " " << pridx << endl;
                if(nxtidx != -1 && tanda != 1 && !vis[nxtidx][curp]) {
                    pq.push(mp(dist + (nxtidx - idx) / curp, mp(nxtidx, mp(curp, 0))));
                }
                if(pridx != -1 && tanda != 0 && !vis[pridx][curp]) {
                    pq.push(mp(dist + (idx - pridx) / curp, mp(pridx, mp(curp, 1))));
                }
            }
        }
        if(idx == target)
            break;
    }
    cout << d[target] << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 4 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 5 ms 5332 KB Output is correct
11 Correct 5 ms 5332 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 5 ms 5332 KB Output is correct
14 Correct 6 ms 5292 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 4 ms 4980 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 4 ms 5060 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 5 ms 5332 KB Output is correct
11 Correct 5 ms 5332 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 5 ms 5332 KB Output is correct
14 Correct 5 ms 5332 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 5 ms 5484 KB Output is correct
17 Correct 13 ms 6960 KB Output is correct
18 Correct 13 ms 6996 KB Output is correct
19 Correct 9 ms 6356 KB Output is correct
20 Correct 39 ms 10196 KB Output is correct
21 Correct 10 ms 5972 KB Output is correct
22 Correct 12 ms 6616 KB Output is correct
23 Correct 15 ms 7108 KB Output is correct
24 Correct 23 ms 8276 KB Output is correct
25 Correct 21 ms 8320 KB Output is correct
26 Correct 4 ms 5332 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 33 ms 10268 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 4 ms 5332 KB Output is correct
32 Correct 3 ms 5332 KB Output is correct
33 Correct 5 ms 5460 KB Output is correct
34 Correct 5 ms 5460 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5076 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 4 ms 5052 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 4 ms 5332 KB Output is correct
11 Correct 5 ms 5332 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 4 ms 5292 KB Output is correct
14 Correct 5 ms 5332 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 6 ms 5460 KB Output is correct
17 Correct 13 ms 6868 KB Output is correct
18 Correct 13 ms 6996 KB Output is correct
19 Correct 9 ms 6356 KB Output is correct
20 Correct 38 ms 10208 KB Output is correct
21 Correct 8 ms 5972 KB Output is correct
22 Correct 11 ms 6612 KB Output is correct
23 Correct 14 ms 7024 KB Output is correct
24 Correct 21 ms 8276 KB Output is correct
25 Correct 21 ms 8292 KB Output is correct
26 Correct 4 ms 5332 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 35 ms 10296 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 5 ms 5332 KB Output is correct
31 Correct 4 ms 5332 KB Output is correct
32 Correct 4 ms 5332 KB Output is correct
33 Correct 6 ms 5460 KB Output is correct
34 Correct 6 ms 5460 KB Output is correct
35 Correct 37 ms 10192 KB Output is correct
36 Correct 18 ms 7872 KB Output is correct
37 Correct 41 ms 11160 KB Output is correct
38 Correct 44 ms 10960 KB Output is correct
39 Correct 40 ms 10216 KB Output is correct
40 Correct 39 ms 10260 KB Output is correct
41 Correct 41 ms 10544 KB Output is correct
42 Correct 8 ms 5588 KB Output is correct
43 Correct 9 ms 5520 KB Output is correct
44 Correct 37 ms 10324 KB Output is correct
45 Correct 22 ms 8016 KB Output is correct
46 Correct 22 ms 7972 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 5 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5004 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 5 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 4 ms 5332 KB Output is correct
11 Correct 5 ms 5352 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 4 ms 5332 KB Output is correct
14 Correct 5 ms 5332 KB Output is correct
15 Correct 5 ms 5460 KB Output is correct
16 Correct 5 ms 5460 KB Output is correct
17 Correct 13 ms 6852 KB Output is correct
18 Correct 13 ms 6968 KB Output is correct
19 Correct 9 ms 6348 KB Output is correct
20 Correct 34 ms 10248 KB Output is correct
21 Correct 8 ms 5972 KB Output is correct
22 Correct 11 ms 6612 KB Output is correct
23 Correct 13 ms 7084 KB Output is correct
24 Correct 26 ms 8280 KB Output is correct
25 Correct 23 ms 8288 KB Output is correct
26 Correct 4 ms 5332 KB Output is correct
27 Correct 5 ms 5412 KB Output is correct
28 Correct 38 ms 10324 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 6 ms 5332 KB Output is correct
31 Correct 4 ms 5336 KB Output is correct
32 Correct 4 ms 5332 KB Output is correct
33 Correct 5 ms 5460 KB Output is correct
34 Correct 5 ms 5460 KB Output is correct
35 Correct 40 ms 10252 KB Output is correct
36 Correct 21 ms 7880 KB Output is correct
37 Correct 44 ms 11176 KB Output is correct
38 Correct 45 ms 10964 KB Output is correct
39 Correct 38 ms 10188 KB Output is correct
40 Correct 42 ms 10220 KB Output is correct
41 Correct 38 ms 10620 KB Output is correct
42 Correct 8 ms 5668 KB Output is correct
43 Correct 8 ms 5588 KB Output is correct
44 Correct 39 ms 10320 KB Output is correct
45 Correct 23 ms 8068 KB Output is correct
46 Correct 21 ms 8016 KB Output is correct
47 Correct 391 ms 34128 KB Output is correct
48 Correct 545 ms 41076 KB Output is correct
49 Correct 477 ms 41328 KB Output is correct
50 Correct 418 ms 34836 KB Output is correct
51 Correct 784 ms 55356 KB Output is correct
52 Correct 770 ms 55868 KB Output is correct
53 Correct 761 ms 52996 KB Output is correct
54 Correct 5 ms 7508 KB Output is correct
55 Correct 4 ms 7556 KB Output is correct
56 Execution timed out 1069 ms 69788 KB Time limit exceeded
57 Halted 0 ms 0 KB -