oj.uz

Submission #719908

# Submission time Handle Problem Language Result Execution time Memory
719908 2023-04-07T04:14:15 Z joelgun14 Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 25608 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 = 200;
    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++;
    }
    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);
        for(int j = 1; j <= blk; ++j) {
            //cout << "INSERT " << b % j << " " << j << " " << b << endl;
            s[pti[mp(b % j, j)]].insert(b);
        }
    }
    // 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 << 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]) {
                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 << curp << " " << blk << 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()) {
                        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()) {
                        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 7 ms 6228 KB Output is correct
2 Correct 8 ms 6188 KB Output is correct
3 Correct 7 ms 6228 KB Output is correct
4 Correct 8 ms 6232 KB Output is correct
5 Correct 8 ms 6268 KB Output is correct
6 Correct 7 ms 6228 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6300 KB Output is correct
2 Correct 6 ms 6228 KB Output is correct
3 Correct 7 ms 6228 KB Output is correct
4 Correct 8 ms 6172 KB Output is correct
5 Correct 7 ms 6240 KB Output is correct
6 Correct 8 ms 6228 KB Output is correct
7 Correct 8 ms 6296 KB Output is correct
8 Correct 11 ms 6356 KB Output is correct
9 Correct 8 ms 6484 KB Output is correct
10 Correct 19 ms 7240 KB Output is correct
11 Correct 48 ms 7208 KB Output is correct
12 Correct 31 ms 6348 KB Output is correct
13 Correct 32 ms 7252 KB Output is correct
14 Correct 39 ms 6908 KB Output is correct
15 Correct 39 ms 6948 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6272 KB Output is correct
2 Correct 9 ms 6164 KB Output is correct
3 Correct 10 ms 6276 KB Output is correct
4 Correct 8 ms 6228 KB Output is correct
5 Correct 7 ms 6228 KB Output is correct
6 Correct 7 ms 6172 KB Output is correct
7 Correct 7 ms 6288 KB Output is correct
8 Correct 7 ms 6356 KB Output is correct
9 Correct 8 ms 6496 KB Output is correct
10 Correct 16 ms 7244 KB Output is correct
11 Correct 59 ms 7208 KB Output is correct
12 Correct 29 ms 6352 KB Output is correct
13 Correct 32 ms 7192 KB Output is correct
14 Correct 43 ms 6884 KB Output is correct
15 Correct 40 ms 6896 KB Output is correct
16 Correct 32 ms 8020 KB Output is correct
17 Correct 126 ms 12896 KB Output is correct
18 Correct 77 ms 13484 KB Output is correct
19 Correct 41 ms 10928 KB Output is correct
20 Correct 233 ms 25500 KB Output is correct
21 Correct 53 ms 9676 KB Output is correct
22 Correct 68 ms 11828 KB Output is correct
23 Correct 102 ms 13384 KB Output is correct
24 Correct 165 ms 17764 KB Output is correct
25 Correct 157 ms 18380 KB Output is correct
26 Correct 50 ms 7004 KB Output is correct
27 Correct 41 ms 6920 KB Output is correct
28 Correct 268 ms 25608 KB Output is correct
29 Correct 19 ms 6740 KB Output is correct
30 Correct 12 ms 6624 KB Output is correct
31 Correct 22 ms 6868 KB Output is correct
32 Correct 16 ms 6944 KB Output is correct
33 Correct 40 ms 7052 KB Output is correct
34 Correct 42 ms 7032 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6208 KB Output is correct
2 Correct 7 ms 6228 KB Output is correct
3 Correct 6 ms 6228 KB Output is correct
4 Correct 7 ms 6228 KB Output is correct
5 Correct 9 ms 6228 KB Output is correct
6 Correct 8 ms 6228 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct
8 Correct 9 ms 6356 KB Output is correct
9 Correct 8 ms 6484 KB Output is correct
10 Correct 15 ms 7200 KB Output is correct
11 Correct 44 ms 7220 KB Output is correct
12 Correct 27 ms 6356 KB Output is correct
13 Correct 32 ms 7144 KB Output is correct
14 Correct 40 ms 6840 KB Output is correct
15 Correct 47 ms 6868 KB Output is correct
16 Correct 29 ms 8008 KB Output is correct
17 Correct 106 ms 12928 KB Output is correct
18 Correct 71 ms 13568 KB Output is correct
19 Correct 39 ms 10884 KB Output is correct
20 Correct 239 ms 25460 KB Output is correct
21 Correct 68 ms 9708 KB Output is correct
22 Correct 56 ms 11884 KB Output is correct
23 Correct 83 ms 13312 KB Output is correct
24 Correct 150 ms 17740 KB Output is correct
25 Correct 152 ms 18284 KB Output is correct
26 Correct 49 ms 7020 KB Output is correct
27 Correct 43 ms 6812 KB Output is correct
28 Correct 275 ms 25488 KB Output is correct
29 Correct 18 ms 6760 KB Output is correct
30 Correct 11 ms 6700 KB Output is correct
31 Correct 17 ms 6868 KB Output is correct
32 Correct 16 ms 6868 KB Output is correct
33 Correct 40 ms 6996 KB Output is correct
34 Correct 41 ms 7016 KB Output is correct
35 Execution timed out 1085 ms 19856 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6300 KB Output is correct
2 Correct 7 ms 6228 KB Output is correct
3 Correct 8 ms 6228 KB Output is correct
4 Correct 8 ms 6228 KB Output is correct
5 Correct 8 ms 6228 KB Output is correct
6 Correct 7 ms 6228 KB Output is correct
7 Correct 8 ms 6296 KB Output is correct
8 Correct 7 ms 6424 KB Output is correct
9 Correct 10 ms 6452 KB Output is correct
10 Correct 17 ms 7124 KB Output is correct
11 Correct 57 ms 7116 KB Output is correct
12 Correct 28 ms 6356 KB Output is correct
13 Correct 32 ms 7208 KB Output is correct
14 Correct 38 ms 6840 KB Output is correct
15 Correct 38 ms 6868 KB Output is correct
16 Correct 29 ms 8028 KB Output is correct
17 Correct 113 ms 12908 KB Output is correct
18 Correct 69 ms 13512 KB Output is correct
19 Correct 52 ms 10836 KB Output is correct
20 Correct 219 ms 25516 KB Output is correct
21 Correct 51 ms 9752 KB Output is correct
22 Correct 46 ms 11852 KB Output is correct
23 Correct 73 ms 13304 KB Output is correct
24 Correct 172 ms 17832 KB Output is correct
25 Correct 157 ms 18380 KB Output is correct
26 Correct 43 ms 7024 KB Output is correct
27 Correct 47 ms 6928 KB Output is correct
28 Correct 231 ms 25608 KB Output is correct
29 Correct 20 ms 6820 KB Output is correct
30 Correct 9 ms 6612 KB Output is correct
31 Correct 17 ms 6864 KB Output is correct
32 Correct 18 ms 6908 KB Output is correct
33 Correct 46 ms 7108 KB Output is correct
34 Correct 38 ms 7032 KB Output is correct
35 Execution timed out 1087 ms 19988 KB Time limit exceeded
36 Halted 0 ms 0 KB -