oj.uz

Submission #396714

# Submission time Handle Problem Language Result Execution time Memory
396714 2021-04-30T16:02:42 Z leinad2 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 805 ms 68020 KB 
#include<bits/stdc++.h>
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]);
    }assert(n!=21193);
    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=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=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]=1e9;
    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]==1e9)A[e]=-1;cout<<A[e];
}

Compilation message

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

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 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 3 ms 2636 KB Output is correct
12 Correct 3 ms 2380 KB Output is correct
13 Correct 4 ms 2636 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 3 ms 2764 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 3 ms 2380 KB Output is correct
6 Correct 3 ms 2380 KB Output is correct
7 Correct 3 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 2 ms 2380 KB Output is correct
10 Correct 3 ms 2508 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Correct 2 ms 2380 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct
16 Correct 2 ms 2508 KB Output is correct
17 Correct 5 ms 3020 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 273 ms 21216 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 2 ms 2508 KB Output is correct
23 Correct 3 ms 2636 KB Output is correct
24 Correct 5 ms 2892 KB Output is correct
25 Correct 4 ms 2764 KB Output is correct
26 Correct 4 ms 2636 KB Output is correct
27 Correct 3 ms 2508 KB Output is correct
28 Correct 5 ms 2892 KB Output is correct
29 Correct 14 ms 3776 KB Output is correct
30 Correct 5 ms 2892 KB Output is correct
31 Correct 8 ms 3152 KB Output is correct
32 Correct 6 ms 2892 KB Output is correct
33 Correct 26 ms 5004 KB Output is correct
34 Correct 26 ms 4952 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 2384 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 3 ms 2636 KB Output is correct
12 Correct 2 ms 2380 KB Output is correct
13 Correct 4 ms 2636 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct
16 Correct 2 ms 2508 KB Output is correct
17 Correct 6 ms 3020 KB Output is correct
18 Correct 3 ms 2636 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 279 ms 21220 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 2 ms 2508 KB Output is correct
23 Correct 3 ms 2636 KB Output is correct
24 Correct 5 ms 2892 KB Output is correct
25 Correct 4 ms 2764 KB Output is correct
26 Correct 4 ms 2636 KB Output is correct
27 Correct 3 ms 2508 KB Output is correct
28 Correct 5 ms 2892 KB Output is correct
29 Correct 15 ms 3784 KB Output is correct
30 Correct 5 ms 2940 KB Output is correct
31 Correct 8 ms 3152 KB Output is correct
32 Correct 6 ms 2892 KB Output is correct
33 Correct 26 ms 4952 KB Output is correct
34 Correct 26 ms 4952 KB Output is correct
35 Correct 36 ms 7612 KB Output is correct
36 Correct 7 ms 3276 KB Output is correct
37 Correct 56 ms 9064 KB Output is correct
38 Correct 54 ms 9880 KB Output is correct
39 Correct 57 ms 9920 KB Output is correct
40 Correct 55 ms 9948 KB Output is correct
41 Correct 52 ms 9912 KB Output is correct
42 Correct 8 ms 2892 KB Output is correct
43 Correct 7 ms 2892 KB Output is correct
44 Correct 805 ms 68020 KB Output is correct
45 Correct 119 ms 14392 KB Output is correct
46 Correct 149 ms 14344 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 2636 KB Output is correct
12 Correct 2 ms 2380 KB Output is correct
13 Correct 4 ms 2636 KB Output is correct
14 Correct 4 ms 2764 KB Output is correct
15 Correct 4 ms 2788 KB Output is correct
16 Correct 2 ms 2508 KB Output is correct
17 Correct 7 ms 3020 KB Output is correct
18 Correct 3 ms 2636 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 297 ms 21212 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 2 ms 2508 KB Output is correct
23 Correct 3 ms 2636 KB Output is correct
24 Correct 6 ms 2924 KB Output is correct
25 Correct 5 ms 2764 KB Output is correct
26 Correct 4 ms 2636 KB Output is correct
27 Correct 3 ms 2508 KB Output is correct
28 Correct 5 ms 2892 KB Output is correct
29 Correct 14 ms 3784 KB Output is correct
30 Correct 5 ms 2892 KB Output is correct
31 Correct 8 ms 3152 KB Output is correct
32 Correct 6 ms 2892 KB Output is correct
33 Correct 27 ms 4952 KB Output is correct
34 Correct 29 ms 4952 KB Output is correct
35 Correct 38 ms 7628 KB Output is correct
36 Correct 8 ms 3276 KB Output is correct
37 Correct 55 ms 9080 KB Output is correct
38 Correct 55 ms 9852 KB Output is correct
39 Correct 75 ms 9912 KB Output is correct
40 Correct 56 ms 9968 KB Output is correct
41 Correct 55 ms 9920 KB Output is correct
42 Correct 8 ms 2892 KB Output is correct
43 Correct 7 ms 2920 KB Output is correct
44 Correct 739 ms 67980 KB Output is correct
45 Correct 116 ms 14388 KB Output is correct
46 Correct 124 ms 14376 KB Output is correct
47 Incorrect 217 ms 22448 KB Output isn't correct
48 Halted 0 ms 0 KB -