oj.uz

답안 #977420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977420 2024-05-07T23:48:58 Z thegamercoder19 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 720 ms 8140 KB 
/*
Coded by thegamercoder
Happy Competition and Hacking
*/


#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ll MAX = 401;
const ll MODD = 998244353;
const ll BL = 1;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto i : a)
#define FORAE(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout<<(s?"YES":"NO")<<endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
ll n, m, p;
V<ll> d, b;
V<V<ll>> fr;
void solve()
{
    cin >> n >> m;
    fr.resize(n); d.resize(n, INFL); b.resize(m);
    FOR(ll, i, 0, m, 1)cin >> b[i] >> p, fr[b[i]].push_back(p);
    PQ<pll, V<pll>, greater<pll>> pq;
    d[b[0]] = 0;
    pq.push({ 0,b[0] });
    WH(!pq.empty())
    {
        auto [du, u] = pq.top(); pq.pop();
        if (du != d[u])continue;
        FORAE(fr[u], p)
        {
            ll dist = 1;
            for (ll v = u + p; v < n; v += p, dist++)
                if (d[v] > d[u] + dist)d[v] = d[u] + dist, pq.push({ d[v],v });
            dist = 1;
            for (ll v = u - p; v >= 0; v -= p, dist++)
                if (d[v] > d[u] + dist)d[v] = d[u] + dist, pq.push({ d[v],v });
        }
    }
    cout << (d[b[1]] == INFL ? -1 : d[b[1]]) << endl;

}
void init()
{

    if (FILER)
    {
        freopen("pump.in", "r", stdin);
        freopen("pump.out", "w", stdout);
    }
}

void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;
    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

Compilation message

skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:64:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |         auto [du, u] = pq.top(); pq.pop();
      |              ^
skyscraper.cpp: In function 'void init()':
skyscraper.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen("pump.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:85:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         freopen("pump.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 4 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 860 KB Output is correct
34 Correct 3 ms 856 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 6 ms 604 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 608 KB Output is correct
25 Correct 1 ms 608 KB Output is correct
26 Correct 4 ms 352 KB Output is correct
27 Correct 4 ms 584 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 608 KB Output is correct
31 Correct 2 ms 612 KB Output is correct
32 Correct 1 ms 612 KB Output is correct
33 Correct 2 ms 860 KB Output is correct
34 Correct 2 ms 864 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct
36 Correct 2 ms 616 KB Output is correct
37 Correct 7 ms 1116 KB Output is correct
38 Correct 6 ms 1624 KB Output is correct
39 Correct 6 ms 1628 KB Output is correct
40 Correct 6 ms 1628 KB Output is correct
41 Correct 6 ms 1488 KB Output is correct
42 Correct 51 ms 1240 KB Output is correct
43 Correct 50 ms 1240 KB Output is correct
44 Correct 51 ms 1296 KB Output is correct
45 Correct 5 ms 1628 KB Output is correct
46 Correct 6 ms 1628 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 372 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 4 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 3 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 860 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct
36 Correct 1 ms 600 KB Output is correct
37 Correct 4 ms 1116 KB Output is correct
38 Correct 6 ms 1680 KB Output is correct
39 Correct 6 ms 1624 KB Output is correct
40 Correct 6 ms 1628 KB Output is correct
41 Correct 6 ms 1628 KB Output is correct
42 Correct 51 ms 1308 KB Output is correct
43 Correct 50 ms 1368 KB Output is correct
44 Correct 59 ms 1240 KB Output is correct
45 Correct 6 ms 1628 KB Output is correct
46 Correct 5 ms 1648 KB Output is correct
47 Correct 13 ms 2644 KB Output is correct
48 Correct 4 ms 1884 KB Output is correct
49 Correct 4 ms 2136 KB Output is correct
50 Correct 3 ms 1884 KB Output is correct
51 Correct 20 ms 4560 KB Output is correct
52 Correct 24 ms 3828 KB Output is correct
53 Correct 11 ms 3544 KB Output is correct
54 Correct 2 ms 1760 KB Output is correct
55 Correct 2 ms 1760 KB Output is correct
56 Correct 720 ms 3412 KB Output is correct
57 Correct 38 ms 6856 KB Output is correct
58 Correct 695 ms 2272 KB Output is correct
59 Correct 714 ms 2396 KB Output is correct
60 Correct 691 ms 2392 KB Output is correct
61 Correct 662 ms 2524 KB Output is correct
62 Correct 7 ms 2908 KB Output is correct
63 Correct 26 ms 4360 KB Output is correct
64 Correct 26 ms 6868 KB Output is correct
65 Correct 34 ms 7888 KB Output is correct
66 Correct 44 ms 7376 KB Output is correct
67 Correct 44 ms 8140 KB Output is correct