oj.uz

Submission #396700

# Submission time Handle Problem Language Result Execution time Memory
396700 2021-04-30T15:44:43 Z leinad2 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 914 ms 118184 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, m, i, j, k, A[30010], a, b, w, s, e, B[30010][2];
vector<pair<int, int> >adj[30010];
map<int, vector<int> >mp[30010];
map<int, vector<int> >::iterator it;
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > >pq;
main()
{
    ios_base::sync_with_stdio(!cin.tie(NULL));
    for(cin>>n>>m;i++<m;)
    {
        cin>>B[i][0]>>B[i][1];
        mp[B[i][1]][B[i][0]%B[i][1]].push_back(B[i][0]);
    }
    for(i=0;i++<30000;)
    {
        for(it=mp[i].begin();it!=mp[i].end();it++)
        {
            vector<int>v=it->second;
            for(k=0;k<v.size();k++)
            {
                a=1;if(k==0)b=0;else b=max(0LL, v[k-1]);
                for(j=v[k]-i;j>=b;j-=i,a++)
                {
                    adj[v[k]].push_back({j, a});
                }
                a=1;if(k+1==v.size())b=n-1;else b=min(n-1, v[k+1]);
                for(j=v[k]+i;j<=b;j+=i,a++)
                {
                    adj[v[k]].push_back({j, a});
                }
            }
        }
    }
    s=B[1][0];e=B[2][0];
    for(i=0;i<n;i++)A[i]=1e18;
    pq.push({0, s});
    while(pq.size())
    {
        pair<int, int>p=pq.top();pq.pop();
        a=p.second;b=p.first;
        if(A[a]<1e9)continue;
        A[a]=b;
        for(i=0;i<adj[a].size();i++)
        {
            pq.push({A[a]+adj[a][i].second, adj[a][i].first});
        }
    }
    if(A[e]==1e18)A[e]=-1;cout<<A[e];
}

Compilation message

skyscraper.cpp:9:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    9 | main()
      |      ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:22:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |             for(k=0;k<v.size();k++)
      |                     ~^~~~~~~~~
skyscraper.cpp:29:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |                 a=1;if(k+1==v.size())b=n-1;else b=min(n-1, v[k+1]);
      |                        ~~~^~~~~~~~~~
skyscraper.cpp:46:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(i=0;i<adj[a].size();i++)
      |                 ~^~~~~~~~~~~~~~
skyscraper.cpp:51:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   51 |     if(A[e]==1e18)A[e]=-1;cout<<A[e];
      |     ^~
skyscraper.cpp:51:27: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   51 |     if(A[e]==1e18)A[e]=-1;cout<<A[e];
      |                           ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2380 KB Output is correct
2 Correct 2 ms 2380 KB Output is correct
3 Correct 2 ms 2384 KB Output is correct
4 Correct 2 ms 2380 KB Output is correct
5 Correct 2 ms 2380 KB Output is correct
6 Correct 2 ms 2380 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2380 KB Output is correct
2 Correct 2 ms 2380 KB Output is correct
3 Correct 3 ms 2336 KB Output is correct
4 Correct 2 ms 2380 KB Output is correct
5 Correct 2 ms 2380 KB Output is correct
6 Correct 2 ms 2380 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct
8 Correct 2 ms 2380 KB Output is correct
9 Correct 2 ms 2380 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 4 ms 2764 KB Output is correct
12 Correct 2 ms 2508 KB Output is correct
13 Correct 4 ms 2896 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 4 ms 2892 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2380 KB Output is correct
2 Correct 2 ms 2380 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 2 ms 2380 KB Output is correct
5 Correct 2 ms 2380 KB Output is correct
6 Correct 2 ms 2380 KB Output is correct
7 Correct 3 ms 2380 KB Output is correct
8 Correct 2 ms 2380 KB Output is correct
9 Correct 2 ms 2380 KB Output is correct
10 Correct 2 ms 2540 KB Output is correct
11 Correct 4 ms 2764 KB Output is correct
12 Correct 2 ms 2508 KB Output is correct
13 Correct 4 ms 2892 KB Output is correct
14 Correct 5 ms 2892 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 2 ms 2508 KB Output is correct
17 Correct 6 ms 3280 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 305 ms 37204 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 2 ms 2660 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 5 ms 3148 KB Output is correct
25 Correct 4 ms 2892 KB Output is correct
26 Correct 4 ms 2764 KB Output is correct
27 Correct 3 ms 2756 KB Output is correct
28 Correct 5 ms 3148 KB Output is correct
29 Correct 16 ms 4900 KB Output is correct
30 Correct 5 ms 3276 KB Output is correct
31 Correct 8 ms 3784 KB Output is correct
32 Correct 6 ms 3276 KB Output is correct
33 Correct 28 ms 7120 KB Output is correct
34 Correct 28 ms 6976 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2380 KB Output is correct
2 Correct 2 ms 2380 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 2 ms 2380 KB Output is correct
5 Correct 2 ms 2380 KB Output is correct
6 Correct 2 ms 2380 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 2 ms 2380 KB Output is correct
10 Correct 2 ms 2508 KB Output is correct
11 Correct 4 ms 2764 KB Output is correct
12 Correct 2 ms 2508 KB Output is correct
13 Correct 4 ms 2892 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 3 ms 2892 KB Output is correct
16 Correct 2 ms 2508 KB Output is correct
17 Correct 6 ms 3280 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 291 ms 37288 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 5 ms 3148 KB Output is correct
25 Correct 4 ms 2892 KB Output is correct
26 Correct 4 ms 2764 KB Output is correct
27 Correct 4 ms 2756 KB Output is correct
28 Correct 5 ms 3148 KB Output is correct
29 Correct 18 ms 4804 KB Output is correct
30 Correct 6 ms 3276 KB Output is correct
31 Correct 9 ms 3848 KB Output is correct
32 Correct 7 ms 3276 KB Output is correct
33 Correct 28 ms 7160 KB Output is correct
34 Correct 28 ms 6976 KB Output is correct
35 Correct 41 ms 9920 KB Output is correct
36 Correct 7 ms 3660 KB Output is correct
37 Correct 59 ms 13508 KB Output is correct
38 Correct 58 ms 13880 KB Output is correct
39 Correct 65 ms 13988 KB Output is correct
40 Correct 73 ms 14040 KB Output is correct
41 Correct 59 ms 14148 KB Output is correct
42 Correct 8 ms 3532 KB Output is correct
43 Correct 8 ms 3536 KB Output is correct
44 Correct 914 ms 118144 KB Output is correct
45 Correct 155 ms 22612 KB Output is correct
46 Correct 130 ms 22744 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2380 KB Output is correct
2 Correct 2 ms 2380 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 2 ms 2380 KB Output is correct
5 Correct 2 ms 2380 KB Output is correct
6 Correct 2 ms 2380 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct
8 Correct 2 ms 2380 KB Output is correct
9 Correct 2 ms 2380 KB Output is correct
10 Correct 2 ms 2508 KB Output is correct
11 Correct 4 ms 2892 KB Output is correct
12 Correct 2 ms 2508 KB Output is correct
13 Correct 4 ms 2892 KB Output is correct
14 Correct 4 ms 2892 KB Output is correct
15 Correct 5 ms 2892 KB Output is correct
16 Correct 2 ms 2512 KB Output is correct
17 Correct 6 ms 3280 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 302 ms 37296 KB Output is correct
21 Correct 3 ms 2536 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 3 ms 2636 KB Output is correct
24 Correct 5 ms 3148 KB Output is correct
25 Correct 4 ms 2892 KB Output is correct
26 Correct 5 ms 2764 KB Output is correct
27 Correct 3 ms 2764 KB Output is correct
28 Correct 5 ms 3148 KB Output is correct
29 Correct 15 ms 4804 KB Output is correct
30 Correct 5 ms 3276 KB Output is correct
31 Correct 8 ms 3784 KB Output is correct
32 Correct 6 ms 3276 KB Output is correct
33 Correct 33 ms 7140 KB Output is correct
34 Correct 34 ms 6976 KB Output is correct
35 Correct 38 ms 9872 KB Output is correct
36 Correct 7 ms 3660 KB Output is correct
37 Correct 59 ms 13488 KB Output is correct
38 Correct 59 ms 13880 KB Output is correct
39 Correct 61 ms 14016 KB Output is correct
40 Correct 62 ms 14076 KB Output is correct
41 Correct 60 ms 13996 KB Output is correct
42 Correct 8 ms 3532 KB Output is correct
43 Correct 8 ms 3556 KB Output is correct
44 Correct 871 ms 118184 KB Output is correct
45 Correct 131 ms 22612 KB Output is correct
46 Correct 143 ms 22640 KB Output is correct
47 Incorrect 265 ms 39232 KB Output isn't correct
48 Halted 0 ms 0 KB -