oj.uz

답안 #245542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245542 2020-07-06T17:06:08 Z mat_v Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 33940 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];

vector<int> poz[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;
        poz[niz[i].xx].pb(i);
    }


    ff(i,1,n){
        int sta = niz[i].xx%niz[i].yy;
        while(sta < m){
            for(auto c:poz[sta]){
                if(c != i)graf[i].pb({c, abs(niz[c].xx - niz[i].xx) / niz[i].yy});
            }
            sta += 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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1664 KB Output is correct
2 Correct 5 ms 1664 KB Output is correct
3 Correct 5 ms 1792 KB Output is correct
4 Correct 5 ms 1792 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 5 ms 1792 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1664 KB Output is correct
2 Correct 6 ms 1664 KB Output is correct
3 Correct 5 ms 1792 KB Output is correct
4 Correct 6 ms 1792 KB Output is correct
5 Correct 6 ms 1788 KB Output is correct
6 Correct 5 ms 1792 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 5 ms 1664 KB Output is correct
9 Correct 5 ms 1792 KB Output is correct
10 Correct 7 ms 1920 KB Output is correct
11 Correct 32 ms 3968 KB Output is correct
12 Correct 75 ms 33656 KB Output is correct
13 Correct 76 ms 33912 KB Output is correct
14 Correct 12 ms 3200 KB Output is correct
15 Correct 12 ms 3200 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1792 KB Output is correct
2 Correct 6 ms 1664 KB Output is correct
3 Correct 6 ms 1792 KB Output is correct
4 Correct 5 ms 1792 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 5 ms 1664 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 5 ms 1792 KB Output is correct
9 Correct 6 ms 1792 KB Output is correct
10 Correct 7 ms 1792 KB Output is correct
11 Correct 32 ms 3968 KB Output is correct
12 Correct 75 ms 33660 KB Output is correct
13 Correct 77 ms 33940 KB Output is correct
14 Correct 12 ms 3200 KB Output is correct
15 Correct 12 ms 3200 KB Output is correct
16 Correct 7 ms 2048 KB Output is correct
17 Correct 71 ms 2432 KB Output is correct
18 Correct 6 ms 1792 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 79 ms 33912 KB Output is correct
21 Correct 9 ms 1792 KB Output is correct
22 Correct 6 ms 1792 KB Output is correct
23 Correct 9 ms 1792 KB Output is correct
24 Correct 36 ms 2048 KB Output is correct
25 Correct 10 ms 1920 KB Output is correct
26 Correct 74 ms 30968 KB Output is correct
27 Correct 83 ms 31736 KB Output is correct
28 Correct 8 ms 2048 KB Output is correct
29 Correct 7 ms 2048 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 6 ms 1920 KB Output is correct
32 Correct 6 ms 1792 KB Output is correct
33 Correct 12 ms 3200 KB Output is correct
34 Correct 13 ms 3200 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1696 KB Output is correct
2 Correct 5 ms 1792 KB Output is correct
3 Correct 5 ms 1792 KB Output is correct
4 Correct 5 ms 1792 KB Output is correct
5 Correct 5 ms 1792 KB Output is correct
6 Correct 6 ms 1792 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 5 ms 1664 KB Output is correct
9 Correct 6 ms 1792 KB Output is correct
10 Correct 8 ms 1792 KB Output is correct
11 Correct 35 ms 3972 KB Output is correct
12 Correct 74 ms 33656 KB Output is correct
13 Correct 75 ms 33912 KB Output is correct
14 Correct 12 ms 3200 KB Output is correct
15 Correct 12 ms 3200 KB Output is correct
16 Correct 7 ms 2048 KB Output is correct
17 Correct 63 ms 2432 KB Output is correct
18 Correct 6 ms 1792 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 80 ms 33912 KB Output is correct
21 Correct 6 ms 1920 KB Output is correct
22 Correct 6 ms 1792 KB Output is correct
23 Correct 9 ms 1920 KB Output is correct
24 Correct 37 ms 2068 KB Output is correct
25 Correct 10 ms 1920 KB Output is correct
26 Correct 75 ms 30968 KB Output is correct
27 Correct 75 ms 31736 KB Output is correct
28 Correct 8 ms 2048 KB Output is correct
29 Correct 7 ms 2048 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 6 ms 1920 KB Output is correct
32 Correct 6 ms 1792 KB Output is correct
33 Correct 13 ms 3260 KB Output is correct
34 Correct 12 ms 3200 KB Output is correct
35 Execution timed out 1092 ms 31896 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1792 KB Output is correct
2 Correct 5 ms 1792 KB Output is correct
3 Correct 5 ms 1792 KB Output is correct
4 Correct 6 ms 1792 KB Output is correct
5 Correct 6 ms 1792 KB Output is correct
6 Correct 5 ms 1792 KB Output is correct
7 Correct 6 ms 1792 KB Output is correct
8 Correct 7 ms 1792 KB Output is correct
9 Correct 5 ms 1792 KB Output is correct
10 Correct 8 ms 1920 KB Output is correct
11 Correct 33 ms 3968 KB Output is correct
12 Correct 74 ms 33656 KB Output is correct
13 Correct 74 ms 33916 KB Output is correct
14 Correct 14 ms 3200 KB Output is correct
15 Correct 17 ms 3200 KB Output is correct
16 Correct 7 ms 2048 KB Output is correct
17 Correct 63 ms 2432 KB Output is correct
18 Correct 6 ms 1792 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 76 ms 33912 KB Output is correct
21 Correct 7 ms 1920 KB Output is correct
22 Correct 6 ms 1792 KB Output is correct
23 Correct 9 ms 1792 KB Output is correct
24 Correct 37 ms 1920 KB Output is correct
25 Correct 10 ms 1920 KB Output is correct
26 Correct 74 ms 30840 KB Output is correct
27 Correct 74 ms 31736 KB Output is correct
28 Correct 8 ms 2048 KB Output is correct
29 Correct 7 ms 2048 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 6 ms 1920 KB Output is correct
32 Correct 6 ms 1792 KB Output is correct
33 Correct 12 ms 3200 KB Output is correct
34 Correct 13 ms 3200 KB Output is correct
35 Execution timed out 1096 ms 31896 KB Time limit exceeded
36 Halted 0 ms 0 KB -