oj.uz

답안 #699924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699924 2023-02-18T10:50:17 Z Abrar_Al_Samit Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 31856 KB 
#include<bits/stdc++.h>
using namespace std;

const int nax = 3e4 + 3;
const int INF = 1e9;

int b[nax], p[nax];
vector<int>doges[nax];

map<pair<int,int>,int>dist;

int get(int x, int y) {
  if(dist.count(make_pair(x, y))) return dist[{x, y}];
  return INF;
}
void PlayGround() {
  int n, m;
  cin>>n>>m;

  for(int i=0; i<m; ++i) {
    cin>>b[i]>>p[i];
    doges[b[i]].push_back(p[i]);
  }

  dist[{b[0], 0}] = 0;

  queue<tuple<int,int,int>>q;
  q.push({b[0], 0, 0});

  while(!q.empty()) {
    auto x = q.front();
    q.pop();
    int ss = get<0>(x);
    int j = get<1>(x);
    int d = get<2>(x);

    if(d!=get(ss, j)) continue;

    if(j==0) {
      for(int z : doges[ss]) {
        if(get(ss, z)>d) {
          dist[{ss, z}] = d;
          q.emplace(ss, z, d);
        }
      }
    } else {
      if(ss+j<n) {
        if(get(ss+j, j)>d+1) {
          dist[{ss+j, j}] = d+1;
          q.emplace(ss+j, j, d+1);
        }
        if(get(ss+j, 0)>d+1) {
          dist[{ss+j, 0}] = d+1;
          q.emplace(ss+j, 0, d+1);
        }
      }
      if(ss-j>=0) {
        if(get(ss-j, j)>d+1) {
          dist[{ss-j, j}] = d+1;
          q.emplace(ss-j, j, d+1);
        }
        if(get(ss-j, 0)>d+1) {
          dist[{ss-j, 0}] = d+1;
          q.emplace(ss-j, 0, d+1);
        }
      }
    }

  }

  int ans = get(b[1], 0);
  if(ans==INF) ans = -1;
  cout<<ans<<'\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1032 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 5 ms 1364 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1060 KB Output is correct
14 Correct 5 ms 1424 KB Output is correct
15 Correct 5 ms 1424 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 1032 KB Output is correct
6 Correct 1 ms 1040 KB Output is correct
7 Correct 1 ms 1028 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 4 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 6 ms 1428 KB Output is correct
15 Correct 5 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 17 ms 2048 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 7 ms 1556 KB Output is correct
24 Correct 17 ms 1888 KB Output is correct
25 Correct 8 ms 1704 KB Output is correct
26 Correct 8 ms 1692 KB Output is correct
27 Correct 6 ms 1620 KB Output is correct
28 Correct 22 ms 2608 KB Output is correct
29 Correct 74 ms 4984 KB Output is correct
30 Correct 17 ms 2132 KB Output is correct
31 Correct 39 ms 3144 KB Output is correct
32 Correct 24 ms 2652 KB Output is correct
33 Correct 184 ms 8688 KB Output is correct
34 Correct 179 ms 8592 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 1040 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 5 ms 1320 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 1040 KB Output is correct
14 Correct 5 ms 1364 KB Output is correct
15 Correct 5 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 20 ms 2032 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 3 ms 1304 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 8 ms 1552 KB Output is correct
24 Correct 16 ms 2004 KB Output is correct
25 Correct 8 ms 1620 KB Output is correct
26 Correct 8 ms 1620 KB Output is correct
27 Correct 7 ms 1620 KB Output is correct
28 Correct 23 ms 2608 KB Output is correct
29 Correct 78 ms 4896 KB Output is correct
30 Correct 18 ms 2188 KB Output is correct
31 Correct 37 ms 3196 KB Output is correct
32 Correct 24 ms 2564 KB Output is correct
33 Correct 175 ms 8692 KB Output is correct
34 Correct 177 ms 8712 KB Output is correct
35 Correct 136 ms 8140 KB Output is correct
36 Correct 20 ms 2308 KB Output is correct
37 Correct 288 ms 12288 KB Output is correct
38 Correct 264 ms 11876 KB Output is correct
39 Correct 284 ms 11876 KB Output is correct
40 Correct 256 ms 11920 KB Output is correct
41 Correct 274 ms 11968 KB Output is correct
42 Correct 12 ms 2136 KB Output is correct
43 Correct 12 ms 2016 KB Output is correct
44 Correct 9 ms 1876 KB Output is correct
45 Execution timed out 1082 ms 31812 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 4 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 1024 KB Output is correct
14 Correct 5 ms 1364 KB Output is correct
15 Correct 5 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 17 ms 1976 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 4 ms 1364 KB Output is correct
21 Correct 1 ms 1040 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 9 ms 1556 KB Output is correct
24 Correct 17 ms 2004 KB Output is correct
25 Correct 8 ms 1604 KB Output is correct
26 Correct 8 ms 1620 KB Output is correct
27 Correct 6 ms 1524 KB Output is correct
28 Correct 22 ms 2632 KB Output is correct
29 Correct 76 ms 4980 KB Output is correct
30 Correct 17 ms 2184 KB Output is correct
31 Correct 35 ms 3172 KB Output is correct
32 Correct 24 ms 2616 KB Output is correct
33 Correct 181 ms 8648 KB Output is correct
34 Correct 176 ms 8708 KB Output is correct
35 Correct 139 ms 8080 KB Output is correct
36 Correct 22 ms 2260 KB Output is correct
37 Correct 359 ms 12368 KB Output is correct
38 Correct 271 ms 11916 KB Output is correct
39 Correct 296 ms 11836 KB Output is correct
40 Correct 263 ms 11904 KB Output is correct
41 Correct 275 ms 11904 KB Output is correct
42 Correct 12 ms 2164 KB Output is correct
43 Correct 11 ms 2072 KB Output is correct
44 Correct 9 ms 1816 KB Output is correct
45 Execution timed out 1034 ms 31856 KB Time limit exceeded
46 Halted 0 ms 0 KB -