oj.uz

답안 #387959

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387959 2021-04-09T15:08:34 Z cpp219 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 57260 KB 
#pragma GCC optimization "Ofast"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 3e4 + 6;
const ll Log2 = 19;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
vector<LL> v;
struct doge{
    ll pos,p,id;
};
doge a[N];
ll n,m,d[N];
map<LL,ll> mp;
vector<LL> g[N];

void Dij(){
    fill(d,d + N - 1,inf);
    set<LL> s; s.insert({0,a[1].pos}); d[a[1].pos] = 0;
    while(!s.empty()){
        LL t = *s.begin(); s.erase(s.begin());
        ll u = t.sc;
        for (auto i : g[u]){
            ll v = i.fs,L = i.sc;
            if (d[v] > d[u] + L){
                s.erase({d[v],v});
                d[v] = d[u] + L; s.insert({d[v],v});
            }
        }
    }
    //for (auto i : g[5]) cout<<i.fs<<"x "; exit(0);
    //cout<<d[2]; exit(0);
    if (d[a[2].pos] != inf) cout<<d[a[2].pos];
    else cout<<-1;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "test"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n>>m;
    for (ll i = 1;i <= m;i++) cin>>a[i].pos>>a[i].p,a[i].pos++;
    for (ll i = 1;i <= m;i++){
        LL now = {a[i].pos,a[i].p};
        if (mp[now]) continue; mp[now] = 1;
        ll cost = 1;
        for (ll j = now.fs + a[i].p;j <= n;j += a[i].p){
            //mp[{j,now.sc}] = 1; //cout<<j<<" ";
            g[now.fs].push_back({j,cost}),cost++;
            if (mp[{j,now.sc}]) break;
        }
        cost = 1; //return 0;
        for (ll j = now.fs - a[i].p;j > 0;j -= a[i].p){
            //mp[{j,now.sc}] = 1;
            g[now.fs].push_back({j,cost}),cost++;
            if (mp[{j,now.sc}]) break;
        }
    }
    Dij();
}

Compilation message

skyscraper.cpp:1: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    1 | #pragma GCC optimization "Ofast"
      | 
skyscraper.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:56:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   56 |         if (mp[now]) continue; mp[now] = 1;
      |         ^~
skyscraper.cpp:56:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   56 |         if (mp[now]) continue; mp[now] = 1;
      |                                ^~
skyscraper.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1076 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 3 ms 1484 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 8 ms 2304 KB Output is correct
18 Correct 3 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 6 ms 1740 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 7 ms 2144 KB Output is correct
25 Correct 4 ms 1740 KB Output is correct
26 Correct 4 ms 1820 KB Output is correct
27 Correct 3 ms 1612 KB Output is correct
28 Correct 9 ms 2764 KB Output is correct
29 Correct 25 ms 5608 KB Output is correct
30 Correct 7 ms 2528 KB Output is correct
31 Correct 14 ms 3660 KB Output is correct
32 Correct 9 ms 2892 KB Output is correct
33 Correct 58 ms 9796 KB Output is correct
34 Correct 66 ms 9872 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 4 ms 1484 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1540 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 7 ms 2252 KB Output is correct
18 Correct 4 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 5 ms 1740 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 4 ms 1612 KB Output is correct
24 Correct 7 ms 2128 KB Output is correct
25 Correct 4 ms 1740 KB Output is correct
26 Correct 4 ms 1740 KB Output is correct
27 Correct 3 ms 1612 KB Output is correct
28 Correct 9 ms 2764 KB Output is correct
29 Correct 27 ms 5612 KB Output is correct
30 Correct 8 ms 2508 KB Output is correct
31 Correct 14 ms 3660 KB Output is correct
32 Correct 10 ms 2892 KB Output is correct
33 Correct 63 ms 9796 KB Output is correct
34 Correct 62 ms 9812 KB Output is correct
35 Correct 69 ms 8968 KB Output is correct
36 Correct 9 ms 2508 KB Output is correct
37 Correct 143 ms 14620 KB Output is correct
38 Correct 159 ms 13528 KB Output is correct
39 Correct 125 ms 13636 KB Output is correct
40 Correct 127 ms 13640 KB Output is correct
41 Correct 138 ms 13512 KB Output is correct
42 Correct 9 ms 2124 KB Output is correct
43 Correct 8 ms 1996 KB Output is correct
44 Correct 12 ms 1996 KB Output is correct
45 Correct 507 ms 35832 KB Output is correct
46 Correct 515 ms 35908 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1104 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 3 ms 1488 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 7 ms 2252 KB Output is correct
18 Correct 3 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 5 ms 1740 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 4 ms 1660 KB Output is correct
24 Correct 6 ms 2140 KB Output is correct
25 Correct 4 ms 1720 KB Output is correct
26 Correct 4 ms 1744 KB Output is correct
27 Correct 3 ms 1612 KB Output is correct
28 Correct 9 ms 2764 KB Output is correct
29 Correct 26 ms 5552 KB Output is correct
30 Correct 8 ms 2508 KB Output is correct
31 Correct 14 ms 3660 KB Output is correct
32 Correct 10 ms 2892 KB Output is correct
33 Correct 57 ms 9796 KB Output is correct
34 Correct 63 ms 9808 KB Output is correct
35 Correct 72 ms 9092 KB Output is correct
36 Correct 9 ms 2508 KB Output is correct
37 Correct 132 ms 14516 KB Output is correct
38 Correct 150 ms 13448 KB Output is correct
39 Correct 126 ms 13604 KB Output is correct
40 Correct 123 ms 13696 KB Output is correct
41 Correct 123 ms 13660 KB Output is correct
42 Correct 9 ms 2124 KB Output is correct
43 Correct 8 ms 1932 KB Output is correct
44 Correct 11 ms 2116 KB Output is correct
45 Correct 539 ms 35864 KB Output is correct
46 Correct 503 ms 35908 KB Output is correct
47 Correct 992 ms 57260 KB Output is correct
48 Correct 161 ms 18416 KB Output is correct
49 Correct 93 ms 11860 KB Output is correct
50 Correct 81 ms 11780 KB Output is correct
51 Correct 334 ms 25976 KB Output is correct
52 Correct 346 ms 28348 KB Output is correct
53 Correct 57 ms 9120 KB Output is correct
54 Correct 11 ms 3916 KB Output is correct
55 Correct 21 ms 5920 KB Output is correct
56 Correct 120 ms 11620 KB Output is correct
57 Execution timed out 1096 ms 46624 KB Time limit exceeded
58 Halted 0 ms 0 KB -