Submission #786167

# Submission time Handle Problem Language Result Execution time Memory
786167 2023-07-18T05:03:12 Z christinelynn Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
1000 ms 262144 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long

vector<int> adj[30005];
int pan[2005][2005];
int arr[2005];
int ARR[2005];
bool vis[2005];

int pro(int a) {
  vis[a] = true;
  for(int i = 0; i < adj[a].size(); i++) {
    if(vis[adj[a][i]] == false) {
      vis[adj[a][i]] = true;
      int b = pro(adj[a][i]);
    }
  }
  return 0;
}

int proses(int a) {
  priority_queue<pair<int, int>> pq;
  for(int i = 0; i < adj[a].size(); i++) {
    pq.push({-1 * pan[a][adj[a][i]], adj[a][i]});
  }
  int jum = -1;
  while(!pq.empty()) {
    int b = pq.top().first * -1;
    int c = pq.top().second;
    if(c == 1) {
      jum = b;
      break;
    }
    for(int i = 0; i < adj[c].size(); i++) {
      pq.push({-1 * (b + pan[c][adj[c][i]]), adj[c][i]});
    }
    pq.pop();
  }
  return jum;
  
}

signed main() {
  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int a, b;
  cin >> a >> b;
  for(int i = 0; i < b; i++) {
    cin >> arr[i] >> ARR[i];
  }
  for(int i = 0; i < b; i++) {
    for(int j = 0; j < b; j++) {
      if(i != j) {
        if((arr[j] - arr[i]) % ARR[i] == 0) {
          pan[i][j] = abs((arr[j] - arr[i]) / ARR[i]);
          adj[i].push_back(j);
        }
      }
    }
  }
  int c = pro(0);
  if(vis[1] == false) {
    cout << -1 << "\n";
    return 0;
  }
  cout << proses(0) << "\n";
  
}

Compilation message

skyscraper.cpp: In function 'long long int pro(long long int)':
skyscraper.cpp:13:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int i = 0; i < adj[a].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~
skyscraper.cpp:16:11: warning: unused variable 'b' [-Wunused-variable]
   16 |       int b = pro(adj[a][i]);
      |           ^
skyscraper.cpp: In function 'long long int proses(long long int)':
skyscraper.cpp:24:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for(int i = 0; i < adj[a].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~
skyscraper.cpp:35:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i = 0; i < adj[c].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:61:7: warning: unused variable 'c' [-Wunused-variable]
   61 |   int c = pro(0);
      |       ^
# Verdict Execution time Memory 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
# Verdict Execution time Memory 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 Execution timed out 1089 ms 262144 KB Time limit exceeded
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 Execution timed out 1054 ms 262144 KB Time limit exceeded
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 Execution timed out 1002 ms 262144 KB Time limit exceeded
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 Execution timed out 1034 ms 262144 KB Time limit exceeded
10 Halted 0 ms 0 KB -