oj.uz

Submission #250360

# Submission time Handle Problem Language Result Execution time Memory
250360 2020-07-17T14:43:13 Z Marlov Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 4076 KB 
/*
Code by @marlov       
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;

#define INF 200000000
#define maxV 30005

int N,M;
pair<int,int> doge[maxV];
int dist[maxV];
vector<int> sat[maxV];
bool visited[maxV];

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>N>>M;
    for(int i=0;i<M;i++){
        cin>>doge[i].first>>doge[i].second;
        dist[i]=INF;
        sat[doge[i].first].push_back(i);
    }
    priority_queue< pair<int,int> > pq;
    dist[0]=0;
    pq.push(make_pair(0,0));
    while(!pq.empty()&&!visited[1]){
        int cd=pq.top().first;
        int ci=pq.top().second;
        pq.pop();
        if(visited[ci]) continue;
        for(int i=doge[ci].first;i>=0;i-=doge[ci].second){
            if(sat[i].size()>0){
                for(int j=0;j<sat[i].size();j++){
                    if(!visited[sat[i][j]]&&dist[sat[i][j]]>dist[ci]+((doge[ci].first-i)/doge[ci].second)){
                        dist[sat[i][j]]=dist[ci]+((doge[ci].first-i)/doge[ci].second);
                        pq.push( make_pair(cd+(i-doge[ci].first),sat[i][j]));
                    }
                }
            }
        }
        for(int i=doge[ci].first;i<N;i+=doge[ci].second){
            if(sat[i].size()>0){
                for(int j=0;j<sat[i].size();j++){
                    if(!visited[sat[i][j]]&&dist[sat[i][j]]>dist[ci]+((i-doge[ci].first)/doge[ci].second)){
                        dist[sat[i][j]]=dist[ci]+((i-doge[ci].first)/doge[ci].second);
                        pq.push( make_pair(cd+(doge[ci].first-i),sat[i][j]));
                    }
                }
            }
        }
    }
    if(dist[1]==INF){
        cout<<-1<<'\n';
    }else{
        cout<<dist[1]<<'\n';
    }
    return 0;
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:52:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int j=0;j<sat[i].size();j++){
                             ~^~~~~~~~~~~~~~
skyscraper.cpp:62:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int j=0;j<sat[i].size();j++){
                             ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Correct 4 ms 1152 KB Output is correct
12 Correct 46 ms 1272 KB Output is correct
13 Correct 43 ms 1152 KB Output is correct
14 Correct 4 ms 1152 KB Output is correct
15 Correct 5 ms 1312 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 4 ms 1152 KB Output is correct
12 Correct 45 ms 1152 KB Output is correct
13 Correct 42 ms 1152 KB Output is correct
14 Correct 5 ms 1152 KB Output is correct
15 Correct 5 ms 1152 KB Output is correct
16 Correct 1 ms 1024 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 1 ms 1152 KB Output is correct
19 Correct 1 ms 1024 KB Output is correct
20 Correct 31 ms 1252 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 1024 KB Output is correct
23 Correct 1 ms 1152 KB Output is correct
24 Correct 3 ms 1152 KB Output is correct
25 Correct 3 ms 1152 KB Output is correct
26 Correct 45 ms 1152 KB Output is correct
27 Correct 44 ms 1152 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 2 ms 1152 KB Output is correct
30 Correct 1 ms 1024 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 2 ms 1024 KB Output is correct
33 Correct 5 ms 1152 KB Output is correct
34 Correct 5 ms 1152 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 4 ms 1152 KB Output is correct
12 Correct 45 ms 1152 KB Output is correct
13 Correct 43 ms 1176 KB Output is correct
14 Correct 4 ms 1152 KB Output is correct
15 Correct 4 ms 1152 KB Output is correct
16 Correct 1 ms 1024 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 1 ms 1152 KB Output is correct
19 Correct 1 ms 1024 KB Output is correct
20 Correct 30 ms 1236 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 1024 KB Output is correct
23 Correct 1 ms 1152 KB Output is correct
24 Correct 3 ms 1152 KB Output is correct
25 Correct 3 ms 1152 KB Output is correct
26 Correct 46 ms 1172 KB Output is correct
27 Correct 45 ms 1152 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 2 ms 1152 KB Output is correct
30 Correct 1 ms 1024 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 1024 KB Output is correct
33 Correct 5 ms 1152 KB Output is correct
34 Correct 5 ms 1152 KB Output is correct
35 Correct 135 ms 2936 KB Output is correct
36 Correct 6 ms 1280 KB Output is correct
37 Correct 106 ms 2300 KB Output is correct
38 Correct 124 ms 3064 KB Output is correct
39 Correct 123 ms 3064 KB Output is correct
40 Correct 187 ms 3072 KB Output is correct
41 Correct 204 ms 4076 KB Output is correct
42 Execution timed out 1092 ms 2176 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Correct 4 ms 1152 KB Output is correct
12 Correct 44 ms 1152 KB Output is correct
13 Correct 42 ms 1152 KB Output is correct
14 Correct 4 ms 1152 KB Output is correct
15 Correct 5 ms 1280 KB Output is correct
16 Correct 2 ms 1024 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 1 ms 1152 KB Output is correct
19 Correct 1 ms 1024 KB Output is correct
20 Correct 29 ms 1152 KB Output is correct
21 Correct 2 ms 1056 KB Output is correct
22 Correct 1 ms 1024 KB Output is correct
23 Correct 2 ms 1152 KB Output is correct
24 Correct 3 ms 1152 KB Output is correct
25 Correct 3 ms 1152 KB Output is correct
26 Correct 44 ms 1152 KB Output is correct
27 Correct 45 ms 1272 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 2 ms 1152 KB Output is correct
30 Correct 1 ms 1024 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 1024 KB Output is correct
33 Correct 5 ms 1152 KB Output is correct
34 Correct 5 ms 1152 KB Output is correct
35 Correct 130 ms 2928 KB Output is correct
36 Correct 6 ms 1280 KB Output is correct
37 Correct 113 ms 2300 KB Output is correct
38 Correct 123 ms 3064 KB Output is correct
39 Correct 126 ms 3064 KB Output is correct
40 Correct 190 ms 3064 KB Output is correct
41 Correct 212 ms 4072 KB Output is correct
42 Execution timed out 1094 ms 2176 KB Time limit exceeded
43 Halted 0 ms 0 KB -