oj.uz

답안 #245540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245540 2020-07-06T17:00:47 Z mat_v Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 7 ms 1152 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;
        if(sta.xx == 2){
            cout << dist[2] << "\n";
            return 0;
        }

        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 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

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 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 Incorrect 7 ms 1152 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 Incorrect 6 ms 1152 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 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 Incorrect 6 ms 1152 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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 Incorrect 6 ms 1152 KB Output isn't correct
11 Halted 0 ms 0 KB -