oj.uz

답안 #486526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486526 2021-11-11T21:57:38 Z fun_day Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 284 ms 262148 KB 
#include <bits/stdc++.h>

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n , m;
  cin >> n >> m;
  vector<vector<pair<int,int>>> adj(n + 1);
  int s = -1 , d = -1;
  for(int i = 0 ; i < m ; i++){
    int a , b;
    cin >> a >> b;
    if(s == -1) s = a;
    else if(d == -1) d = a;
    for(int j = a + b , cnt = 1 ; j < n ; j += b , cnt++){
      adj[a].emplace_back(j , cnt);
    }
    for(int j = a - b , cnt = 1 ; j >= 0 ; j -= b , cnt++){
      adj[a].emplace_back(j , cnt);
    }
  }
  priority_queue<pair<int,int> , vector<pair<int,int>> , greater<pair<int,int>>> pq;
  pq.emplace(0 , s);
  vector<int> dist(n + 1 , (int)1e9);
  dist[s] = 0;
  while(!pq.empty()){
    auto f = pq.top();
    pq.pop();
    if(f.first != dist[f.second]) continue;
    for(auto x : adj[f.second]){
      int node = x.first;
      int cost = x.second;
      if(dist[node] > f.first + cost){
        dist[node] = f.first + cost;
        pq.emplace(dist[node] , node);
      }
    }
  }
  if(dist[d] == (int)1e9) cout << -1 << '\n';
  else cout << dist[d] << '\n';
  return 0; 
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 2432 KB Output is correct
13 Correct 3 ms 2512 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 42 ms 32464 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 448 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 47 ms 33416 KB Output is correct
27 Correct 44 ms 33344 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 3 ms 1228 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 828 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 3 ms 1868 KB Output is correct
34 Correct 4 ms 1868 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 2500 KB Output is correct
13 Correct 3 ms 2512 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 42 ms 32452 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 50 ms 33372 KB Output is correct
27 Correct 46 ms 33288 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 2 ms 1228 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 2 ms 844 KB Output is correct
32 Correct 1 ms 616 KB Output is correct
33 Correct 3 ms 1868 KB Output is correct
34 Correct 4 ms 1868 KB Output is correct
35 Correct 7 ms 2124 KB Output is correct
36 Correct 2 ms 588 KB Output is correct
37 Correct 8 ms 3772 KB Output is correct
38 Correct 9 ms 3148 KB Output is correct
39 Correct 13 ms 3392 KB Output is correct
40 Correct 12 ms 3300 KB Output is correct
41 Correct 9 ms 3148 KB Output is correct
42 Runtime error 284 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 2500 KB Output is correct
13 Correct 4 ms 2512 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 43 ms 32440 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 508 KB Output is correct
26 Correct 49 ms 33476 KB Output is correct
27 Correct 57 ms 33316 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 3 ms 1228 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 844 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 3 ms 1868 KB Output is correct
34 Correct 5 ms 1836 KB Output is correct
35 Correct 6 ms 2124 KB Output is correct
36 Correct 2 ms 588 KB Output is correct
37 Correct 8 ms 3764 KB Output is correct
38 Correct 9 ms 3248 KB Output is correct
39 Correct 9 ms 3404 KB Output is correct
40 Correct 12 ms 3276 KB Output is correct
41 Correct 9 ms 3148 KB Output is correct
42 Runtime error 263 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -