oj.uz

Submission #54672

# Submission time Handle Problem Language Result Execution time Memory
54672 2018-07-04T11:52:17 Z aquablitz11 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 31272 KB 
// headers
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// types
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using dbl = double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using piipi = pair<pii, int>;
using pipii = pair<int, pii>;
using plpii = pair<ll, pii>;
using ppii = pair<pii, pii>;
// loops
#define forx(i, x, y) for (int i = (x); i <= (y); ++i)
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define for1(i, n) for (int i = 1; i <= (n); ++i)
#define rofx(i, x, y) for (int i = x; i >= y; --i)
#define rofn(i, n) for (int i = n-1; i >= 0; --i)
#define rof1(i, n) for (int i = n; i >= 1; --i)
#define fora(x, v) for (auto x : v)
// define shortcuts
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define X first
#define Y second
#define MP make_pair
#define MT make_tuple
// functions
template<class T> inline bool hasbit(T x, int i) { return x&(1<<i); }
template<class T> inline T togbit(T x, int i) { return x|(1<<i); }
template<class T> inline T setbit(T x, int i) { return x|(1<<i); }
template<class T> inline T rembit(T x, int i) { return x&~(1<<i); }
template<class T> inline bool setmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool setmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> int compress(vector<T> &v) { sort(all(v)); v.resize(unique(all(v))-v.begin()); return v.size(); }
// read functions
int read_int() { int x; scanf("%d", &x); return x; }
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
void _R(int &x) { x = read_int(); }
void _R(ll &x) { x = read_ll(); }
void _R(dbl &x) { x = read_dbl(); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
// print functions
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%" PRId64, x); }
void _W(const ull &x) { printf("%" PRIu64, x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
// pseudo-random number generator
template<class T, T x1, T x2, T x3, int y1, int y2, int y3>
struct PRNG {
    using S = typename make_signed<T>::type;
    T s;
    PRNG(T _s = 0) : s(_s) {}
    T next() {
        T z = (s += x1);
        z = (z ^ (z >> y1)) * x2;
        z = (z ^ (z >> y2)) * x3;
        return z ^ (z >> y3);
    }
    T next(T n) { return next() % n; }
    S next(S l, S r) { return l + next(r - l + 1); }
    T operator()() { return next(); }
    T operator()(T n) { return next(n); }
    S operator()(S l, S r) { return next(l, r); }
    static T gen(T s) { return PRNG(s)(); }
    template<class U>
    void shuffle(U first, U last) {
        size_t n = last - first;
        for (size_t i = 0; i < n; i++) swap(first[i], first[next(i + 1)]);
    }
};
PRNG<uint32_t, 0x9E3779B1, 0x85EBCA6B, 0xC2B2AE35, 16, 13, 16> r32;
PRNG<uint64_t, 0x9E3779B97F4A7C15, 0xBF58476D1CE4E5B9, 0x94D049BB133111EB, 30, 27, 31> r64;
// program
int _main();
int main() {
    //ios::sync_with_stdio(false), cin.tie(0);
    //time_t begin = clock();
    int ret = _main();
    //time_t end = clock();
    //fprintf(stderr, "Program took %.3f seconds to compute\n", ((double)end-begin)/CLOCKS_PER_SEC);
    return ret;
}

/************************************************************
                CODE STARTS BELOW THIS POINT
************************************************************/

const int N = 2010;
const int M = 30010;

vector<int> li[N];

int _main()
{
    int n, m;
    R(n, m);
    int s, t;
    forn(ix, m) {
        int i, j;
        R(i, j);
        li[i].pb(j);
        if (ix == 0) s = i;
        if (ix == 1) t = i;
    }

    deque<pii> Q;
    map<pii, int> dist;
    dist.insert({{s, 0}, 0});
    Q.push_back({s, 0});
    while (!Q.empty()) {
        int i = Q.front().F, j = Q.front().S, d = dist[Q.front()];
        Q.pop_front();
        if (i == t) {
            W(d);
            return 0;
        }
        if (j == 0)  {
            fora(k, li[i]) if (!dist.count(pii(i, k))) {
                dist.insert({{i, k}, d});
                Q.push_front({i, k});
            }
        } else {
            if (!dist.count(pii(i, 0))) {
                dist.insert({{i, 0}, d});
                Q.push_front({i, 0});
            }
            if (i-j >= 0 && !dist.count(pii(i-j, j))) {
                dist.insert({{i-j, j}, d+1});
                Q.push_back({i-j, j});
            }
            if (i+j < n && !dist.count(pii(i+j, j))) {
                dist.insert({{i+j, j}, d+1});
                Q.push_back({i+j, j});
            }
        }
    }
    W(-1);
    
    return 0;
}

Compilation message

skyscraper.cpp: In function 'll read_ll()':
skyscraper.cpp:49:42: warning: format '%ld' expects argument of type 'long int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                                        ~~^
skyscraper.cpp: In function 'ull read_ull()':
skyscraper.cpp:50:45: warning: format '%lu' expects argument of type 'long unsigned int*', but argument 2 has type 'ull* {aka long long unsigned int*}' [-Wformat=]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                                           ~~^
skyscraper.cpp: In function 'void _W(const ll&)':
skyscraper.cpp:60:44: warning: format '%ld' expects argument of type 'long int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 void _W(const ll &x) { printf("%" PRId64, x); }
                                           ~^
skyscraper.cpp: In function 'void _W(const ull&)':
skyscraper.cpp:61:45: warning: format '%lu' expects argument of type 'long unsigned int', but argument 2 has type 'ull {aka long long unsigned int}' [-Wformat=]
 void _W(const ull &x) { printf("%" PRIu64, x); }
                                            ~^
skyscraper.cpp: In function 'int read_int()':
skyscraper.cpp:48:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 int read_int() { int x; scanf("%d", &x); return x; }
                         ~~~~~^~~~~~~~~~
skyscraper.cpp: In function 'll read_ll()':
skyscraper.cpp:49:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                      ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp: In function 'ull read_ull()':
skyscraper.cpp:50:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                         ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp: In function 'dbl read_dbl()':
skyscraper.cpp:51:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
                         ~~~~~^~~~~~~~~~~
skyscraper.cpp: In function 'int _main()':
skyscraper.cpp:134:9: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (i == t) {
         ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 636 KB Output is correct
4 Correct 2 ms 636 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 3 ms 636 KB Output is correct
12 Correct 2 ms 636 KB Output is correct
13 Correct 2 ms 636 KB Output is correct
14 Correct 6 ms 956 KB Output is correct
15 Correct 4 ms 956 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 956 KB Output is correct
2 Correct 2 ms 956 KB Output is correct
3 Correct 2 ms 956 KB Output is correct
4 Correct 2 ms 956 KB Output is correct
5 Correct 2 ms 956 KB Output is correct
6 Correct 3 ms 956 KB Output is correct
7 Correct 2 ms 956 KB Output is correct
8 Correct 2 ms 956 KB Output is correct
9 Correct 2 ms 956 KB Output is correct
10 Correct 3 ms 956 KB Output is correct
11 Correct 2 ms 956 KB Output is correct
12 Correct 3 ms 956 KB Output is correct
13 Correct 3 ms 956 KB Output is correct
14 Correct 6 ms 964 KB Output is correct
15 Correct 4 ms 964 KB Output is correct
16 Correct 2 ms 964 KB Output is correct
17 Correct 5 ms 964 KB Output is correct
18 Correct 2 ms 964 KB Output is correct
19 Correct 2 ms 964 KB Output is correct
20 Correct 3 ms 964 KB Output is correct
21 Correct 2 ms 964 KB Output is correct
22 Correct 2 ms 964 KB Output is correct
23 Correct 6 ms 1020 KB Output is correct
24 Correct 8 ms 1148 KB Output is correct
25 Correct 3 ms 1148 KB Output is correct
26 Correct 4 ms 1148 KB Output is correct
27 Correct 5 ms 1148 KB Output is correct
28 Correct 23 ms 2048 KB Output is correct
29 Correct 68 ms 4604 KB Output is correct
30 Correct 15 ms 4604 KB Output is correct
31 Correct 31 ms 4604 KB Output is correct
32 Correct 23 ms 4604 KB Output is correct
33 Correct 167 ms 8380 KB Output is correct
34 Correct 80 ms 8380 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8380 KB Output is correct
2 Correct 2 ms 8380 KB Output is correct
3 Correct 2 ms 8380 KB Output is correct
4 Correct 2 ms 8380 KB Output is correct
5 Correct 2 ms 8380 KB Output is correct
6 Correct 2 ms 8380 KB Output is correct
7 Correct 2 ms 8380 KB Output is correct
8 Correct 2 ms 8380 KB Output is correct
9 Correct 2 ms 8380 KB Output is correct
10 Correct 3 ms 8380 KB Output is correct
11 Correct 4 ms 8380 KB Output is correct
12 Correct 3 ms 8380 KB Output is correct
13 Correct 2 ms 8380 KB Output is correct
14 Correct 6 ms 8380 KB Output is correct
15 Correct 4 ms 8380 KB Output is correct
16 Correct 2 ms 8380 KB Output is correct
17 Correct 5 ms 8380 KB Output is correct
18 Correct 3 ms 8380 KB Output is correct
19 Correct 3 ms 8380 KB Output is correct
20 Correct 5 ms 8380 KB Output is correct
21 Correct 2 ms 8380 KB Output is correct
22 Correct 2 ms 8380 KB Output is correct
23 Correct 6 ms 8380 KB Output is correct
24 Correct 8 ms 8380 KB Output is correct
25 Correct 3 ms 8380 KB Output is correct
26 Correct 4 ms 8380 KB Output is correct
27 Correct 5 ms 8380 KB Output is correct
28 Correct 19 ms 8380 KB Output is correct
29 Correct 69 ms 8380 KB Output is correct
30 Correct 15 ms 8380 KB Output is correct
31 Correct 32 ms 8380 KB Output is correct
32 Correct 22 ms 8380 KB Output is correct
33 Correct 234 ms 8380 KB Output is correct
34 Correct 94 ms 8380 KB Output is correct
35 Correct 61 ms 8380 KB Output is correct
36 Correct 4 ms 8380 KB Output is correct
37 Correct 39 ms 8380 KB Output is correct
38 Correct 22 ms 8380 KB Output is correct
39 Correct 11 ms 8380 KB Output is correct
40 Correct 14 ms 8380 KB Output is correct
41 Correct 60 ms 8380 KB Output is correct
42 Correct 10 ms 8380 KB Output is correct
43 Correct 11 ms 8380 KB Output is correct
44 Correct 10 ms 8380 KB Output is correct
45 Execution timed out 1078 ms 31272 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 31272 KB Output is correct
2 Correct 2 ms 31272 KB Output is correct
3 Correct 2 ms 31272 KB Output is correct
4 Correct 2 ms 31272 KB Output is correct
5 Correct 3 ms 31272 KB Output is correct
6 Correct 2 ms 31272 KB Output is correct
7 Correct 2 ms 31272 KB Output is correct
8 Correct 2 ms 31272 KB Output is correct
9 Correct 2 ms 31272 KB Output is correct
10 Correct 2 ms 31272 KB Output is correct
11 Correct 3 ms 31272 KB Output is correct
12 Correct 2 ms 31272 KB Output is correct
13 Correct 2 ms 31272 KB Output is correct
14 Correct 6 ms 31272 KB Output is correct
15 Correct 4 ms 31272 KB Output is correct
16 Correct 2 ms 31272 KB Output is correct
17 Correct 4 ms 31272 KB Output is correct
18 Correct 2 ms 31272 KB Output is correct
19 Correct 2 ms 31272 KB Output is correct
20 Correct 3 ms 31272 KB Output is correct
21 Correct 2 ms 31272 KB Output is correct
22 Correct 2 ms 31272 KB Output is correct
23 Correct 6 ms 31272 KB Output is correct
24 Correct 8 ms 31272 KB Output is correct
25 Correct 3 ms 31272 KB Output is correct
26 Correct 4 ms 31272 KB Output is correct
27 Correct 5 ms 31272 KB Output is correct
28 Correct 19 ms 31272 KB Output is correct
29 Correct 68 ms 31272 KB Output is correct
30 Correct 17 ms 31272 KB Output is correct
31 Correct 33 ms 31272 KB Output is correct
32 Correct 23 ms 31272 KB Output is correct
33 Correct 163 ms 31272 KB Output is correct
34 Correct 79 ms 31272 KB Output is correct
35 Correct 53 ms 31272 KB Output is correct
36 Correct 4 ms 31272 KB Output is correct
37 Correct 37 ms 31272 KB Output is correct
38 Correct 22 ms 31272 KB Output is correct
39 Correct 11 ms 31272 KB Output is correct
40 Correct 14 ms 31272 KB Output is correct
41 Correct 44 ms 31272 KB Output is correct
42 Correct 10 ms 31272 KB Output is correct
43 Correct 12 ms 31272 KB Output is correct
44 Correct 10 ms 31272 KB Output is correct
45 Execution timed out 1077 ms 31272 KB Time limit exceeded
46 Halted 0 ms 0 KB -