oj.uz

Submission #207096

# Submission time Handle Problem Language Result Execution time Memory
207096 2020-03-06T12:16:23 Z Sa1loum Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 512 ms 41072 KB 
#include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mem(a,b) memset(a, b, sizeof(a))
#define F first
#define S second
#define Si size()
#define pb(x) push_back(x)
typedef double D;
typedef long long ll;
typedef long double ld;
const int MOD=(int)1e9+7,MAX=(int)1e4+10;
int n,m,b[MAX],p[MAX],vis[MAX];
vector <pair<int,int> > v[MAX];
int main()
{
    scanf("%d%d",&n,&m);
    int s,e;
    for (int i=0;i<m;i++) {
        scanf("%d%d",&b[i],&p[i]);
        int d=0;
        if (i==0) s=b[i];
        if (i==1) e=b[i];
        for (int j=b[i],k=b[i];;j+=p[i],k-=p[i]) {
            bool flag=0;
            if (0<=j && j<n) {
                flag=1;
                if (j!=b[i]) {
                    v[b[i]].push_back({j,d});
                }
            }
            if (0<=k && k<n) {
                flag=1;
                if (k!=b[i]) {
                    v[b[i]].push_back({k,d});
                }
            }
            d++;
            if (!flag) break;
        }
    }
    priority_queue <pair<int,int>> pq;
    pq.push({0,s});
    while (!pq.empty()) {
        int x=pq.top().S;
        int w=-pq.top().F;
        pq.pop();
        if (vis[x]) continue;
        vis[x]=1;
        if (x==e) {printf("%d\n",w); return 0;}
        for (auto it:v[x]) {
            if (vis[it.F]) continue;
            pq.push({-w-it.S,it.F});
        }
    }
    puts("-1\n");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&b[i],&p[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:50:9: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (x==e) {printf("%d\n",w); return 0;}
         ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 9 ms 2796 KB Output is correct
13 Correct 10 ms 2796 KB Output is correct
14 Correct 6 ms 760 KB Output is correct
15 Correct 6 ms 632 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 508 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 9 ms 2796 KB Output is correct
13 Correct 10 ms 2796 KB Output is correct
14 Correct 7 ms 632 KB Output is correct
15 Correct 6 ms 760 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 5 ms 632 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 505 ms 41072 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 6 ms 632 KB Output is correct
23 Correct 6 ms 636 KB Output is correct
24 Correct 6 ms 760 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 76 ms 33596 KB Output is correct
27 Correct 73 ms 33596 KB Output is correct
28 Correct 6 ms 760 KB Output is correct
29 Correct 15 ms 1908 KB Output is correct
30 Correct 8 ms 1016 KB Output is correct
31 Correct 9 ms 1272 KB Output is correct
32 Correct 7 ms 1016 KB Output is correct
33 Correct 28 ms 3056 KB Output is correct
34 Correct 21 ms 2924 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 9 ms 2792 KB Output is correct
13 Correct 10 ms 2792 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 632 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 6 ms 1020 KB Output is correct
18 Correct 5 ms 632 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 503 ms 40992 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 5 ms 632 KB Output is correct
23 Correct 6 ms 632 KB Output is correct
24 Correct 7 ms 760 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 75 ms 33724 KB Output is correct
27 Correct 76 ms 33596 KB Output is correct
28 Correct 6 ms 760 KB Output is correct
29 Correct 16 ms 1908 KB Output is correct
30 Correct 7 ms 1016 KB Output is correct
31 Correct 9 ms 1272 KB Output is correct
32 Correct 7 ms 1016 KB Output is correct
33 Correct 27 ms 3056 KB Output is correct
34 Correct 20 ms 2928 KB Output is correct
35 Incorrect 10 ms 1656 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 10 ms 2792 KB Output is correct
13 Correct 10 ms 2792 KB Output is correct
14 Correct 6 ms 632 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 6 ms 1016 KB Output is correct
18 Correct 5 ms 632 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 512 ms 41072 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 5 ms 632 KB Output is correct
23 Correct 6 ms 632 KB Output is correct
24 Correct 6 ms 760 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 75 ms 33688 KB Output is correct
27 Correct 74 ms 33640 KB Output is correct
28 Correct 6 ms 760 KB Output is correct
29 Correct 16 ms 1908 KB Output is correct
30 Correct 7 ms 1016 KB Output is correct
31 Correct 9 ms 1272 KB Output is correct
32 Correct 7 ms 1016 KB Output is correct
33 Correct 27 ms 3052 KB Output is correct
34 Correct 20 ms 3056 KB Output is correct
35 Incorrect 10 ms 1656 KB Output isn't correct
36 Halted 0 ms 0 KB -