oj.uz

Submission #577774

# Submission time Handle Problem Language Result Execution time Memory
577774 2022-06-15T08:51:00 Z Sam_a17 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 126 ms 157528 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());

#define pb push_back
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }

  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 3e4 + 10;
vector<pair<int, int>> A;
vector<int> adj[N];
bool vis[N][N];
int n, m, dest;

void solve_() {
  cin >> n >> m;
  for(int i = 1; i <= m; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);  
    A.push_back({a, b});

    if(i == 2) {
      dest = a;
    }
  }

  queue<pair<pair<int, int>, int>> q;

  q.push({A[0], 0});
  vis[A[0].second][A[0].first] = true;
  while(!q.empty()) {
    auto u = q.front();
    q.pop();

    if(u.first.first == dest) {
      printf("%d\n", u.second);
      return;
    }

    // 
    int x = u.first.first, l = u.first.second;
    if(x + l < n && !vis[l][x + l]) {
      vis[l][x + l] = true;
      q.push({{x + l, l}, u.second + 1});
    }

    if(x - l >= 0 && !vis[l][x - l]) {
      vis[l][x - l] = true;
      q.push({{x - l, l}, u.second + 1});
    }

    //
    for(auto i: adj[x]) {
      l = i;
      if(x + l < n && !vis[l][x + l]) {
        vis[l][x + l] = true;
        q.push({{x + l, l}, u.second + 1});
      }

      if(x - l >= 0 && !vis[l][x - l]) {
        vis[l][x - l] = true;
        q.push({{x - l, l}, u.second + 1});
      }
    }
  }

  printf("-1\n");
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

skyscraper.cpp: In function 'void setIO(std::string)':
skyscraper.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.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

Subtask #2
12.0 / 12.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
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1044 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct

Subtask #3
14.0 / 14.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
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1036 KB Output is correct
14 Correct 3 ms 1364 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 3 ms 3092 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 3 ms 3284 KB Output is correct
24 Correct 5 ms 5912 KB Output is correct
25 Correct 2 ms 2260 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 3 ms 2516 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 2 ms 1160 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 5 ms 1492 KB Output is correct
34 Correct 3 ms 1364 KB Output is correct

Subtask #4
21.0 / 21.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
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 2 ms 1036 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct
16 Correct 1 ms 1036 KB Output is correct
17 Correct 2 ms 3028 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 3 ms 3344 KB Output is correct
24 Correct 4 ms 5776 KB Output is correct
25 Correct 3 ms 2260 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 3 ms 2516 KB Output is correct
29 Correct 3 ms 1236 KB Output is correct
30 Correct 2 ms 1032 KB Output is correct
31 Correct 2 ms 1156 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 3 ms 1492 KB Output is correct
34 Correct 3 ms 1364 KB Output is correct
35 Correct 12 ms 9296 KB Output is correct
36 Correct 3 ms 3088 KB Output is correct
37 Correct 9 ms 7100 KB Output is correct
38 Correct 14 ms 12908 KB Output is correct
39 Correct 7 ms 2192 KB Output is correct
40 Correct 10 ms 4308 KB Output is correct
41 Correct 11 ms 9364 KB Output is correct
42 Correct 5 ms 1748 KB Output is correct
43 Correct 8 ms 2452 KB Output is correct
44 Correct 5 ms 1732 KB Output is correct
45 Correct 27 ms 3772 KB Output is correct
46 Correct 25 ms 3660 KB Output is correct

Subtask #5
43.0 / 43.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 1032 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 1 ms 1236 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 2 ms 1292 KB Output is correct
15 Correct 3 ms 1364 KB Output is correct
16 Correct 1 ms 1032 KB Output is correct
17 Correct 3 ms 3088 KB Output is correct
18 Correct 2 ms 1044 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 3284 KB Output is correct
24 Correct 5 ms 5692 KB Output is correct
25 Correct 2 ms 2260 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 3 ms 2496 KB Output is correct
29 Correct 3 ms 1208 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 3 ms 1492 KB Output is correct
34 Correct 3 ms 1424 KB Output is correct
35 Correct 13 ms 9204 KB Output is correct
36 Correct 3 ms 3028 KB Output is correct
37 Correct 10 ms 7028 KB Output is correct
38 Correct 16 ms 12884 KB Output is correct
39 Correct 7 ms 2196 KB Output is correct
40 Correct 9 ms 4244 KB Output is correct
41 Correct 15 ms 9240 KB Output is correct
42 Correct 5 ms 1748 KB Output is correct
43 Correct 6 ms 2516 KB Output is correct
44 Correct 8 ms 1732 KB Output is correct
45 Correct 27 ms 3780 KB Output is correct
46 Correct 24 ms 3664 KB Output is correct
47 Correct 17 ms 19024 KB Output is correct
48 Correct 6 ms 1876 KB Output is correct
49 Correct 6 ms 1876 KB Output is correct
50 Correct 5 ms 1684 KB Output is correct
51 Correct 104 ms 141420 KB Output is correct
52 Correct 115 ms 157528 KB Output is correct
53 Correct 16 ms 15936 KB Output is correct
54 Correct 1 ms 980 KB Output is correct
55 Correct 2 ms 980 KB Output is correct
56 Correct 7 ms 2384 KB Output is correct
57 Correct 2 ms 1220 KB Output is correct
58 Correct 6 ms 2004 KB Output is correct
59 Correct 6 ms 2260 KB Output is correct
60 Correct 7 ms 2256 KB Output is correct
61 Correct 9 ms 6740 KB Output is correct
62 Correct 68 ms 59944 KB Output is correct
63 Correct 82 ms 13864 KB Output is correct
64 Correct 73 ms 9312 KB Output is correct
65 Correct 78 ms 9416 KB Output is correct
66 Correct 126 ms 9524 KB Output is correct
67 Correct 91 ms 6976 KB Output is correct