oj.uz

Submission #786168

# Submission time Handle Problem Language Result Execution time Memory
786168 2023-07-18T05:03:41 Z devariaota Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 1 ms 596 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define keish                             ios_base::sync_with_stdio(0);       cin.tie(0); cout.tie(0)
      
using namespace std;
const int mod = 1e9 + 7;

int n, m;

signed main(){
      keish;
      cin >> n >> m;
      vector<int> b(m), p(m);
      vector<vector<int>> e(n);
      for(int i = 0; i < n; i++){
            cin >> b[i] >> p[i];
            e[b[i]].push_back(p[i]);
      }

      vector<vector<int>> dis(n, vector<int>(2005));
      queue<pair<int, int>> q;     
      for(auto x : e[b[0]]){
            dis[b[0]][x] = 0;  
            q.push({b[0], x});
      }

      while(!q.empty()){
            auto [u, d] = q.front(); q.pop();

            if(u == b[1]){
                  cout << dis[u][d] << '\n';
                  return 0;
            }

            if(u + d < n){
                  if(dis[u + d][d] != -1){
                        dis[u + d][d] = dis[u][d] + 1;
                        q.push({u + d, d});
                  }
                  for(auto v : e[u + d]){
                        if(dis[u + d][v] != -1){
                              dis[u + d][v] = dis[u][d] + 1;
                              q.push({u + d, v});
                        }
                  }
            }

            if(u - d >= 0){
                  if(dis[u - d][d] != -1){
                        dis[u - d][d] = dis[u][d] + 1;
                        q.push({u - d, d});
                  }
                  for(auto v : e[u - d]){
                        if(dis[u - d][v] != -1){
                              dis[u - d][v] = dis[u][d] + 1;
                              q.push({u - d, v});
                        }
                  }
            }
      }

      cout << -1 << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -