oj.uz

Submission #245541

# Submission time Handle Problem Language Result Execution time Memory
245541 2020-07-06T17:01:39 Z mat_v Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 33148 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>


using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());




int n,m;
pii niz[30005];

vector<pii> graf[30005];
int dist[30005];

struct kurac{
    int xx;
    int yy;
};

bool operator < (const kurac &prvi, const kurac &drugi){
    return prvi.yy < drugi.yy;
}

int main()
{

    //ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> m >> n;
    ff(i,1,n){
        cin >> niz[i].xx >> niz[i].yy;
    }
    ff(i,1,n){
        ff(j,1,n){
            if(i == j)continue;
            int dist = abs(niz[i].xx - niz[j].xx);
            if(dist % niz[i].yy == 0)graf[i].pb({j, dist / niz[i].yy});
        }
    }

    priority_queue<kurac> pq;
    pq.push({1,0});
    ff(i,1,n)dist[i] = 1e9;
    dist[1] = 0;
    while(!pq.empty()){
        kurac sta = pq.top();
        pq.pop();


        if(sta.yy != dist[sta.xx])continue;

        for(auto c:graf[sta.xx]){
            if(dist[c.xx] > c.yy + sta.yy){
                dist[c.xx] = c.yy + sta.yy;
                pq.push({c.xx, dist[c.xx]});
            }
        }
    }
    if(dist[2] == 1e9)cout << -1 << "\n";
    else cout << dist[2] << "\n";
    return 0;
}

Compilation message

skyscraper.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1056 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 9 ms 1152 KB Output is correct
11 Correct 54 ms 3200 KB Output is correct
12 Correct 78 ms 33016 KB Output is correct
13 Correct 74 ms 33144 KB Output is correct
14 Correct 37 ms 2424 KB Output is correct
15 Correct 35 ms 2432 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 8 ms 1152 KB Output is correct
11 Correct 55 ms 3252 KB Output is correct
12 Correct 81 ms 33016 KB Output is correct
13 Correct 78 ms 33148 KB Output is correct
14 Correct 35 ms 2512 KB Output is correct
15 Correct 34 ms 2424 KB Output is correct
16 Correct 10 ms 1408 KB Output is correct
17 Correct 76 ms 1664 KB Output is correct
18 Correct 11 ms 1152 KB Output is correct
19 Correct 7 ms 1024 KB Output is correct
20 Correct 78 ms 33144 KB Output is correct
21 Correct 13 ms 1184 KB Output is correct
22 Correct 8 ms 1024 KB Output is correct
23 Correct 13 ms 1152 KB Output is correct
24 Correct 56 ms 1272 KB Output is correct
25 Correct 31 ms 1152 KB Output is correct
26 Correct 69 ms 30200 KB Output is correct
27 Correct 74 ms 30968 KB Output is correct
28 Correct 29 ms 1280 KB Output is correct
29 Correct 10 ms 1280 KB Output is correct
30 Correct 5 ms 1024 KB Output is correct
31 Correct 8 ms 1152 KB Output is correct
32 Correct 7 ms 1152 KB Output is correct
33 Correct 37 ms 2432 KB Output is correct
34 Correct 34 ms 2552 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 6 ms 1024 KB Output is correct
10 Correct 8 ms 1152 KB Output is correct
11 Correct 53 ms 3200 KB Output is correct
12 Correct 77 ms 33016 KB Output is correct
13 Correct 77 ms 33144 KB Output is correct
14 Correct 34 ms 2552 KB Output is correct
15 Correct 34 ms 2428 KB Output is correct
16 Correct 10 ms 1408 KB Output is correct
17 Correct 75 ms 1656 KB Output is correct
18 Correct 11 ms 1152 KB Output is correct
19 Correct 7 ms 1024 KB Output is correct
20 Correct 80 ms 33148 KB Output is correct
21 Correct 14 ms 1152 KB Output is correct
22 Correct 9 ms 1024 KB Output is correct
23 Correct 13 ms 1152 KB Output is correct
24 Correct 56 ms 1280 KB Output is correct
25 Correct 32 ms 1152 KB Output is correct
26 Correct 71 ms 30200 KB Output is correct
27 Correct 77 ms 30968 KB Output is correct
28 Correct 29 ms 1280 KB Output is correct
29 Correct 10 ms 1280 KB Output is correct
30 Correct 6 ms 1024 KB Output is correct
31 Correct 8 ms 1220 KB Output is correct
32 Correct 7 ms 1152 KB Output is correct
33 Correct 35 ms 2432 KB Output is correct
34 Correct 35 ms 2432 KB Output is correct
35 Execution timed out 1091 ms 10548 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 8 ms 1152 KB Output is correct
11 Correct 56 ms 3192 KB Output is correct
12 Correct 73 ms 33016 KB Output is correct
13 Correct 76 ms 33148 KB Output is correct
14 Correct 35 ms 2552 KB Output is correct
15 Correct 34 ms 2424 KB Output is correct
16 Correct 10 ms 1344 KB Output is correct
17 Correct 75 ms 1664 KB Output is correct
18 Correct 11 ms 1152 KB Output is correct
19 Correct 8 ms 1024 KB Output is correct
20 Correct 74 ms 33144 KB Output is correct
21 Correct 13 ms 1152 KB Output is correct
22 Correct 9 ms 1024 KB Output is correct
23 Correct 13 ms 1152 KB Output is correct
24 Correct 57 ms 1280 KB Output is correct
25 Correct 31 ms 1272 KB Output is correct
26 Correct 71 ms 30200 KB Output is correct
27 Correct 70 ms 30968 KB Output is correct
28 Correct 29 ms 1280 KB Output is correct
29 Correct 10 ms 1408 KB Output is correct
30 Correct 5 ms 1024 KB Output is correct
31 Correct 8 ms 1152 KB Output is correct
32 Correct 7 ms 1152 KB Output is correct
33 Correct 34 ms 2432 KB Output is correct
34 Correct 34 ms 2432 KB Output is correct
35 Execution timed out 1087 ms 10440 KB Time limit exceeded
36 Halted 0 ms 0 KB -