oj.uz

Submission #229619

# Submission time Handle Problem Language Result Execution time Memory
229619 2020-05-05T11:38:13 Z Nightlight Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 19 ms 23040 KB 
#include <queue>
#include <cstdio>
#include <tuple>
#include <cstring>
#define pii pair<int, int>
#define piii tuple<int, int, int>
#define mt make_tuple
#define push_back emplace_back
using namespace std;

int N, M;
pii A[30005];
int dist[30005][180];
int vis[30005][180];
vector<pii> adj[30005];
vector<int> dog[30005];

void BFS() {
  priority_queue<piii> pq;
  memset(dist, 0x3f3f3f3f, sizeof(dist));
  pq.push(make_tuple(0, A[0].first, 0));
  dist[A[0].first][0] = 0;
  int u, mov; int trav;
  while(!pq.empty()) {
    tie(trav, u, mov) = pq.top();
    if(u == A[1].first) {
      printf("%d\n", trav);
      exit(0);
    }
    pq.pop();
    if(dist[u][mov] < trav) continue;
    if(mov != 0) {
      if(u - mov >= 0 && trav + 1 < dist[u - mov][mov]) {
        dist[u - mov][mov] = trav + 1;
        pq.push(make_tuple(trav + 1, u - mov, mov));
      }
      if(u + mov <= N && trav + 1 < dist[u + mov][mov]) {
        dist[u + mov][mov] = trav + 1;
        pq.push(make_tuple(trav + 1, u + mov, mov));
      }
      if(dist[u][0] > trav) {
        dist[u][0] = trav;
        pq.push(make_tuple(trav, u, 0));
      }
    }else {
      int v, w;
      for(pii now : adj[u]) {
        v = now.first, w = now.second + trav;
        if(w < dist[v][0]) {
          dist[v][0] = w;
          pq.push(make_tuple(w, v, 0));
        }
      }
      for(int v : dog[u]) {
        if(trav < dist[u][v]) {
          dist[u][v] = trav;
          pq.push(make_tuple(trav, u, v));
        }
      }
    }
  }
  puts("-1");
//  if(dist[A[1].first][0] == 0x3f3f3f3f) puts("-1");
//  else printf("%d\n", dist[A[1].first][0]);
}

int main() {
//  freopen("out.txt", "w", stdout);
  scanf("%d %d", &N, &M);
  int pos, mov;
  for(int i = 0; i < M; i++) {
    scanf("%d %d", &pos, &mov);
    A[i] = make_pair(pos, mov);
    if(mov * mov > N) {
      for(int i = pos - mov, j = 1; i >= 0; i -= mov, j++) {
        adj[pos].push_back(i, j);
      }
      for(int i = pos + mov, j = 1; i <= N; i += mov, j++) {
        adj[pos].push_back(i, j);
      }
    }else {
      dog[pos].push_back(mov);
    }
  }
  BFS();
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &N, &M);
   ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &pos, &mov);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 22912 KB Output is correct
2 Correct 16 ms 22912 KB Output is correct
3 Correct 16 ms 22932 KB Output is correct
4 Correct 16 ms 22912 KB Output is correct
5 Correct 16 ms 22912 KB Output is correct
6 Correct 16 ms 22912 KB Output is correct
7 Correct 17 ms 22912 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 22912 KB Output is correct
2 Correct 17 ms 22912 KB Output is correct
3 Correct 16 ms 22912 KB Output is correct
4 Correct 19 ms 22912 KB Output is correct
5 Correct 16 ms 22912 KB Output is correct
6 Correct 17 ms 22912 KB Output is correct
7 Correct 17 ms 22784 KB Output is correct
8 Correct 16 ms 22912 KB Output is correct
9 Correct 16 ms 22912 KB Output is correct
10 Incorrect 16 ms 22912 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23040 KB Output is correct
2 Correct 16 ms 22912 KB Output is correct
3 Correct 16 ms 22912 KB Output is correct
4 Correct 16 ms 22912 KB Output is correct
5 Correct 16 ms 22912 KB Output is correct
6 Correct 16 ms 22912 KB Output is correct
7 Correct 16 ms 22912 KB Output is correct
8 Correct 16 ms 22912 KB Output is correct
9 Correct 16 ms 22912 KB Output is correct
10 Incorrect 16 ms 22912 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 22912 KB Output is correct
2 Correct 16 ms 22912 KB Output is correct
3 Correct 16 ms 22912 KB Output is correct
4 Correct 16 ms 22912 KB Output is correct
5 Correct 16 ms 22912 KB Output is correct
6 Correct 16 ms 22912 KB Output is correct
7 Correct 17 ms 22912 KB Output is correct
8 Correct 16 ms 22912 KB Output is correct
9 Correct 16 ms 22912 KB Output is correct
10 Incorrect 16 ms 22912 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 22912 KB Output is correct
2 Correct 16 ms 22912 KB Output is correct
3 Correct 17 ms 22912 KB Output is correct
4 Correct 16 ms 22912 KB Output is correct
5 Correct 17 ms 22912 KB Output is correct
6 Correct 16 ms 22932 KB Output is correct
7 Correct 16 ms 22912 KB Output is correct
8 Correct 16 ms 22912 KB Output is correct
9 Correct 16 ms 22912 KB Output is correct
10 Incorrect 16 ms 22912 KB Output isn't correct
11 Halted 0 ms 0 KB -