oj.uz

답안 #238139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
238139 2020-06-10T03:19:46 Z Mercenary Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 9 ms 3456 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "SKY"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 5e4 + 5;
const int mod = 1e9 + 7;
int dis[maxn] , n , m;
unordered_set<int> s[maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n >> m;
    int ft = 0 , lt = 0;
    for(int i = 0 ; i < m ; ++i){
        int u ,v;cin >> u >> v;s[u].insert(v);
        if(i == 0)ft = u;
        if(i == 1)lt = u;
    }
    priority_queue<ii , vector<ii> , greater<ii> > pq;
    fill_n(dis,maxn,1e9);
    dis[ft] = 0;pq.push(mp(0,ft));
    while(pq.size()){
        auto u = pq.top();pq.pop();
        if(dis[u.second] != u.first)continue;
        for(auto &c : s[u.second]){
            int cnt = 0;
            for(int i = u.second + c ; i < n ; i += c){
                cnt++;
                if(u.first + cnt < dis[i]){
                    dis[i] = u.first + cnt;pq.push(mp(dis[i],i));
                }
                if(s[i].count(c))break;
            }
            cnt = 0;
            for(int i = u.second - c ; i > 0 ; i -= c){
                cnt++;
                if(u.first + cnt < dis[i]){
                    dis[i] = u.first + cnt;pq.push(mp(dis[i],i));
                }
                if(s[i].count(c))break;
            }
        }
    }
    if(dis[lt] == 1e9)cout << -1;
    else cout << dis[lt];
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3200 KB Output is correct
2 Correct 6 ms 3328 KB Output is correct
3 Correct 7 ms 3328 KB Output is correct
4 Correct 6 ms 3200 KB Output is correct
5 Correct 6 ms 3200 KB Output is correct
6 Correct 6 ms 3328 KB Output is correct
7 Correct 7 ms 3200 KB Output is correct
8 Correct 6 ms 3200 KB Output is correct
9 Correct 6 ms 3328 KB Output is correct
10 Correct 8 ms 3328 KB Output is correct
11 Correct 7 ms 3328 KB Output is correct
12 Correct 7 ms 3200 KB Output is correct
13 Correct 7 ms 3328 KB Output is correct
14 Correct 7 ms 3328 KB Output is correct
15 Correct 7 ms 3328 KB Output is correct
16 Correct 7 ms 3328 KB Output is correct
17 Correct 8 ms 3328 KB Output is correct
18 Correct 7 ms 3328 KB Output is correct
19 Correct 7 ms 3328 KB Output is correct
20 Correct 8 ms 3456 KB Output is correct
21 Correct 7 ms 3328 KB Output is correct
22 Correct 7 ms 3328 KB Output is correct
23 Correct 7 ms 3328 KB Output is correct
24 Correct 8 ms 3456 KB Output is correct
25 Correct 8 ms 3456 KB Output is correct
26 Correct 7 ms 3328 KB Output is correct
27 Correct 7 ms 3328 KB Output is correct
28 Incorrect 8 ms 3328 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3328 KB Output is correct
2 Correct 7 ms 3328 KB Output is correct
3 Correct 6 ms 3328 KB Output is correct
4 Correct 6 ms 3200 KB Output is correct
5 Correct 6 ms 3200 KB Output is correct
6 Correct 6 ms 3200 KB Output is correct
7 Correct 6 ms 3200 KB Output is correct
8 Correct 7 ms 3328 KB Output is correct
9 Correct 6 ms 3328 KB Output is correct
10 Correct 7 ms 3328 KB Output is correct
11 Correct 7 ms 3328 KB Output is correct
12 Correct 7 ms 3328 KB Output is correct
13 Correct 6 ms 3328 KB Output is correct
14 Correct 7 ms 3328 KB Output is correct
15 Correct 8 ms 3456 KB Output is correct
16 Correct 7 ms 3328 KB Output is correct
17 Correct 7 ms 3328 KB Output is correct
18 Correct 7 ms 3328 KB Output is correct
19 Correct 6 ms 3328 KB Output is correct
20 Correct 8 ms 3456 KB Output is correct
21 Correct 7 ms 3328 KB Output is correct
22 Correct 6 ms 3328 KB Output is correct
23 Correct 7 ms 3328 KB Output is correct
24 Correct 9 ms 3456 KB Output is correct
25 Correct 8 ms 3456 KB Output is correct
26 Correct 8 ms 3328 KB Output is correct
27 Correct 7 ms 3268 KB Output is correct
28 Incorrect 8 ms 3328 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3200 KB Output is correct
2 Correct 7 ms 3328 KB Output is correct
3 Correct 7 ms 3200 KB Output is correct
4 Correct 7 ms 3200 KB Output is correct
5 Correct 7 ms 3200 KB Output is correct
6 Correct 7 ms 3200 KB Output is correct
7 Correct 7 ms 3328 KB Output is correct
8 Correct 6 ms 3200 KB Output is correct
9 Correct 7 ms 3328 KB Output is correct
10 Correct 6 ms 3328 KB Output is correct
11 Correct 8 ms 3328 KB Output is correct
12 Correct 7 ms 3328 KB Output is correct
13 Correct 7 ms 3328 KB Output is correct
14 Correct 7 ms 3456 KB Output is correct
15 Correct 9 ms 3328 KB Output is correct
16 Correct 7 ms 3328 KB Output is correct
17 Correct 8 ms 3328 KB Output is correct
18 Correct 7 ms 3328 KB Output is correct
19 Correct 7 ms 3328 KB Output is correct
20 Correct 8 ms 3328 KB Output is correct
21 Correct 7 ms 3328 KB Output is correct
22 Correct 7 ms 3328 KB Output is correct
23 Correct 7 ms 3328 KB Output is correct
24 Correct 8 ms 3456 KB Output is correct
25 Correct 8 ms 3456 KB Output is correct
26 Correct 7 ms 3328 KB Output is correct
27 Correct 7 ms 3328 KB Output is correct
28 Incorrect 8 ms 3328 KB Output isn't correct
29 Halted 0 ms 0 KB -