oj.uz

Submission #588523

# Submission time Handle Problem Language Result Execution time Memory
588523 2022-07-03T13:06:21 Z xynex Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 476 ms 3704 KB 
/**
  * Author: Tenjin
  * Created: 28.06.2022 14:48
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e4 + 1;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

int dist[N];
int n, m;
vt<int> g[N];
void dijkstra(int v) {
  for(int i = 0; i < n; ++i) {
    dist[i] = MOD;
  }
  dist[v] = 0;
  set<pr<int, int> > q = {{0, v}};
  while(!q.empty()) {
    int v = (*q.begin()).ss;
    int cost = (*q.begin()).ff;
    q.erase(q.begin());
    for(auto to : g[v]) {
      for(int i = 1; v + i * to < n; ++i) {
        if(dist[v + i * to] > (i + cost)) {
          q.erase(mp(dist[v + i * to], v + i * to));
          dist[v + i * to] = i + cost;
          q.insert(mp(dist[v + i * to], v + i * to));
        }
      }
      for(int i = 1; v - i * to >= 0; ++i) {
        if(dist[v - i * to] > (i + cost)) {
          q.erase(mp(dist[v - i * to], v - i * to));
          dist[v - i * to] = i + cost;
          q.insert(mp(dist[v - i * to], v - i * to));
        }
      }
    }
  }
}
void solve() {
  read(n, m);
  int st = 0, en = 0;
  for(int i = 1; i <= m; ++i) {
    int l, r; read(l, r);
    g[l].pb(r);
    if(i == 1) st = l;
    else if(i == 2) en = l;
  }
  dijkstra(st);
  if(dist[en] == MOD) dist[en] = -1;
  print(dist[en]);
}

int main() {
  //freop("");
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
//  read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}

Compilation message

skyscraper.cpp: In function 'void freop(std::string)':
skyscraper.cpp:71:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".out").c_str(), "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 1032 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 1028 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 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 2 ms 980 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 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 1044 KB Output is correct
14 Correct 2 ms 980 KB Output is correct
15 Correct 1 ms 1044 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 980 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 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 1 ms 980 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 1172 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 3 ms 1108 KB Output is correct
28 Correct 1 ms 1112 KB Output is correct
29 Correct 3 ms 1108 KB Output is correct
30 Correct 3 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 4 ms 1108 KB Output is correct
34 Correct 4 ms 1108 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 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 1036 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1040 KB Output is correct
18 Correct 1 ms 1036 KB Output is correct
19 Correct 1 ms 1040 KB Output is correct
20 Correct 3 ms 1172 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 1036 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 3 ms 1108 KB Output is correct
28 Correct 1 ms 1064 KB Output is correct
29 Correct 3 ms 1108 KB Output is correct
30 Correct 3 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 5 ms 1044 KB Output is correct
34 Correct 5 ms 1040 KB Output is correct
35 Correct 7 ms 1492 KB Output is correct
36 Correct 2 ms 1092 KB Output is correct
37 Correct 6 ms 1364 KB Output is correct
38 Correct 8 ms 1560 KB Output is correct
39 Correct 7 ms 1492 KB Output is correct
40 Correct 9 ms 1492 KB Output is correct
41 Correct 8 ms 1492 KB Output is correct
42 Correct 27 ms 1496 KB Output is correct
43 Correct 30 ms 1492 KB Output is correct
44 Correct 27 ms 1492 KB Output is correct
45 Correct 8 ms 1428 KB Output is correct
46 Correct 8 ms 1428 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 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 980 KB Output is correct
11 Correct 1 ms 1040 KB Output is correct
12 Correct 1 ms 1048 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 968 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1032 KB Output is correct
17 Correct 2 ms 980 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 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 1 ms 980 KB Output is correct
24 Correct 2 ms 1040 KB Output is correct
25 Correct 2 ms 1184 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 4 ms 1040 KB Output is correct
28 Correct 2 ms 1044 KB Output is correct
29 Correct 4 ms 1236 KB Output is correct
30 Correct 3 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 4 ms 1108 KB Output is correct
34 Correct 4 ms 1108 KB Output is correct
35 Correct 6 ms 1476 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 6 ms 1364 KB Output is correct
38 Correct 7 ms 1492 KB Output is correct
39 Correct 7 ms 1492 KB Output is correct
40 Correct 8 ms 1604 KB Output is correct
41 Correct 8 ms 1492 KB Output is correct
42 Correct 28 ms 1492 KB Output is correct
43 Correct 29 ms 1428 KB Output is correct
44 Correct 28 ms 1584 KB Output is correct
45 Correct 9 ms 1424 KB Output is correct
46 Correct 8 ms 1484 KB Output is correct
47 Correct 23 ms 2292 KB Output is correct
48 Correct 5 ms 1748 KB Output is correct
49 Correct 5 ms 1748 KB Output is correct
50 Correct 4 ms 1556 KB Output is correct
51 Correct 42 ms 3412 KB Output is correct
52 Correct 40 ms 3176 KB Output is correct
53 Correct 18 ms 3284 KB Output is correct
54 Correct 5 ms 1748 KB Output is correct
55 Correct 6 ms 1748 KB Output is correct
56 Correct 399 ms 3704 KB Output is correct
57 Correct 75 ms 2600 KB Output is correct
58 Correct 476 ms 2124 KB Output is correct
59 Correct 333 ms 2188 KB Output is correct
60 Correct 421 ms 2148 KB Output is correct
61 Correct 331 ms 2208 KB Output is correct
62 Correct 9 ms 2388 KB Output is correct
63 Correct 55 ms 2980 KB Output is correct
64 Correct 62 ms 3028 KB Output is correct
65 Correct 70 ms 2940 KB Output is correct
66 Correct 93 ms 2936 KB Output is correct
67 Correct 89 ms 2900 KB Output is correct