oj.uz

답안 #245550

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

int ima[3005][3005];

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);
            int duz = dist / niz[i].yy;
            if(dist % niz[i].yy == 0){
                if(1 == 2)n = 5;
                else{
                    //ima[niz[i].xx][niz[i].yy] = dist;
                    graf[niz[i].xx].pb({niz[j].xx, duz});
                }
            }
        }
    }

    priority_queue<kurac> pq;
    pq.push({niz[1].xx,0});
    ff(i,0,m-1)dist[i] = 1e9;
    dist[niz[1].xx] = 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[niz[2].xx] == 1e9)cout << -1 << "\n";
    else cout << dist[niz[2].xx] << "\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 5 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 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 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 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
8 Correct 5 ms 1792 KB Output is correct
9 Correct 5 ms 1792 KB Output is correct
10 Correct 8 ms 1792 KB Output is correct
11 Correct 36 ms 3960 KB Output is correct
12 Correct 80 ms 34748 KB Output is correct
13 Correct 89 ms 35532 KB Output is correct
14 Correct 31 ms 3200 KB Output is correct
15 Correct 30 ms 3072 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 5 ms 1792 KB Output is correct
6 Correct 6 ms 1792 KB Output is correct
7 Correct 6 ms 1792 KB Output is correct
8 Correct 5 ms 1792 KB Output is correct
9 Correct 5 ms 1792 KB Output is correct
10 Correct 7 ms 1792 KB Output is correct
11 Correct 35 ms 3960 KB Output is correct
12 Correct 82 ms 34764 KB Output is correct
13 Correct 91 ms 35520 KB Output is correct
14 Correct 31 ms 3064 KB Output is correct
15 Correct 32 ms 3072 KB Output is correct
16 Correct 10 ms 2048 KB Output is correct
17 Correct 47 ms 2432 KB Output is correct
18 Correct 11 ms 1792 KB Output is correct
19 Correct 8 ms 1792 KB Output is correct
20 Correct 71 ms 33912 KB Output is correct
21 Correct 14 ms 1920 KB Output is correct
22 Correct 9 ms 1792 KB Output is correct
23 Correct 14 ms 1792 KB Output is correct
24 Correct 43 ms 1920 KB Output is correct
25 Correct 31 ms 1920 KB Output is correct
26 Correct 78 ms 34748 KB Output is correct
27 Correct 77 ms 34928 KB Output is correct
28 Correct 30 ms 2048 KB Output is correct
29 Correct 9 ms 2048 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 8 ms 1920 KB Output is correct
32 Correct 7 ms 1920 KB Output is correct
33 Correct 31 ms 3200 KB Output is correct
34 Correct 34 ms 3196 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1792 KB Output is correct
2 Correct 6 ms 1792 KB Output is correct
3 Correct 6 ms 1792 KB Output is correct
4 Correct 6 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
8 Correct 6 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 35 ms 3960 KB Output is correct
12 Correct 81 ms 34760 KB Output is correct
13 Correct 80 ms 35516 KB Output is correct
14 Correct 32 ms 3064 KB Output is correct
15 Correct 33 ms 3072 KB Output is correct
16 Correct 11 ms 2048 KB Output is correct
17 Correct 50 ms 2432 KB Output is correct
18 Correct 12 ms 1920 KB Output is correct
19 Correct 8 ms 1792 KB Output is correct
20 Correct 75 ms 33912 KB Output is correct
21 Correct 14 ms 1920 KB Output is correct
22 Correct 9 ms 1792 KB Output is correct
23 Correct 13 ms 1792 KB Output is correct
24 Correct 43 ms 1920 KB Output is correct
25 Correct 31 ms 1920 KB Output is correct
26 Correct 77 ms 34764 KB Output is correct
27 Correct 78 ms 34800 KB Output is correct
28 Correct 30 ms 2048 KB Output is correct
29 Correct 9 ms 2048 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 8 ms 1920 KB Output is correct
32 Correct 7 ms 1792 KB Output is correct
33 Correct 32 ms 3192 KB Output is correct
34 Correct 31 ms 3192 KB Output is correct
35 Execution timed out 1090 ms 11308 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 7 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 5 ms 1792 KB Output is correct
9 Correct 5 ms 1792 KB Output is correct
10 Correct 7 ms 1792 KB Output is correct
11 Correct 35 ms 3968 KB Output is correct
12 Correct 90 ms 34764 KB Output is correct
13 Correct 81 ms 35516 KB Output is correct
14 Correct 30 ms 3072 KB Output is correct
15 Correct 31 ms 2944 KB Output is correct
16 Correct 11 ms 2048 KB Output is correct
17 Correct 49 ms 2432 KB Output is correct
18 Correct 12 ms 1792 KB Output is correct
19 Correct 8 ms 1792 KB Output is correct
20 Correct 79 ms 33912 KB Output is correct
21 Correct 14 ms 1920 KB Output is correct
22 Correct 9 ms 1792 KB Output is correct
23 Correct 14 ms 1792 KB Output is correct
24 Correct 43 ms 1920 KB Output is correct
25 Correct 31 ms 1920 KB Output is correct
26 Correct 77 ms 34852 KB Output is correct
27 Correct 82 ms 34932 KB Output is correct
28 Correct 30 ms 2048 KB Output is correct
29 Correct 9 ms 2048 KB Output is correct
30 Correct 6 ms 1792 KB Output is correct
31 Correct 9 ms 1920 KB Output is correct
32 Correct 7 ms 1792 KB Output is correct
33 Correct 31 ms 3192 KB Output is correct
34 Correct 31 ms 3192 KB Output is correct
35 Execution timed out 1090 ms 11524 KB Time limit exceeded
36 Halted 0 ms 0 KB -