oj.uz

Submission #926494

# Submission time Handle Problem Language Result Execution time Memory
926494 2024-02-13T06:33:28 Z Boycl07 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 84 ms 12488 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define rep(i, n) for(int i = 1; i <= n; ++i)
#define forn(i, l, r) for(int i = l; i <= r; ++i)
#define ford(i, r, l) for(int i = r; i >= l; --i)
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define FORD(i, n) for(int i = n - 1; i >= 0; --i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define endl "\n"
#define task "skycrapers"
#define sz(a) int(a.size())
#define C(x, y) make_pair(x, y)
#define all(a) (a).begin(), (a).end()
#define bit(i, mask) (mask >> i & 1)

template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }

inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}


const int N =  1e5 + 10;
const int M = 1e3 + 3;
const int N1 = 2e3 + 10;
const int K = 1e2 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 3;
const ll LINF = 1e17 + 2;
const int block_size = 500;
const int LOG = 40;
const int offset = N;
const int LIM = 11 ;
const int AL = 26;

int n, m, s, t;

set<int> doges[N];
int d[N];

void solve()
{
    cin >> n >> m;

    FOR(i, m)
    {
        int x, y;
        cin >> x >> y;
        doges[x].insert(y);
        if(i == 0) s = x;
        else if(i == 1) t = x;
    }

    priority_queue<pii, vector<pii>, greater<pii>> pq;
    FOR(i, n) d[i] = INF;
    d[s] = 0; pq.push({0, s});
    while(!pq.empty())
    {
        pii tmp = pq.top();
        pq.pop();

        int u = tmp.se, dist = tmp.fi;
        if(d[u] != dist) continue;
        if(u == t) return cout << dist, void();

        for(int p : doges[u])
        {
            for(int j = 1; u + p * j < n; ++j)
            {
                int v = u + p * j;
                if(minimize(d[v], d[u] + j))
                    pq.push({d[v], v});
                if(doges[v].find(p) != doges[v].end()) break;
            }
            for(int j = 1; u - p * j >= 0; ++j)
            {
                int v = u - p * j;
                if(minimize(d[v], d[u] + j))
                    pq.push({d[v], v});
                if(doges[v].find(p) != doges[v].end()) break;
            }
        }
    }
    cout << -1;



}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int TC = 1;

    if(fopen(task".inp", "r"))
    {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }


    while(TC--)
    {
        solve();
        cout << endl;
    }

    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:108:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB Output is correct
2 Correct 2 ms 5468 KB Output is correct
3 Correct 1 ms 5212 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct
6 Correct 1 ms 5208 KB Output is correct
7 Correct 1 ms 5212 KB Output is correct
8 Correct 1 ms 5212 KB Output is correct
9 Correct 1 ms 5212 KB Output is correct
10 Correct 1 ms 5212 KB Output is correct
11 Correct 2 ms 5464 KB Output is correct
12 Correct 1 ms 5384 KB Output is correct
13 Correct 1 ms 5212 KB Output is correct
14 Correct 2 ms 5468 KB Output is correct
15 Correct 2 ms 5464 KB Output is correct
16 Correct 2 ms 5212 KB Output is correct
17 Correct 2 ms 5468 KB Output is correct
18 Correct 2 ms 5212 KB Output is correct
19 Correct 1 ms 5368 KB Output is correct
20 Correct 2 ms 5468 KB Output is correct
21 Correct 1 ms 5212 KB Output is correct
22 Correct 6 ms 5212 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 2 ms 5464 KB Output is correct
25 Correct 2 ms 5464 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 2 ms 5424 KB Output is correct
29 Correct 4 ms 5468 KB Output is correct
30 Correct 2 ms 5468 KB Output is correct
31 Correct 2 ms 5468 KB Output is correct
32 Correct 2 ms 5468 KB Output is correct
33 Correct 5 ms 5724 KB Output is correct
34 Correct 3 ms 5780 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 1 ms 5208 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 1 ms 5212 KB Output is correct
7 Correct 1 ms 5212 KB Output is correct
8 Correct 1 ms 5212 KB Output is correct
9 Correct 1 ms 5212 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 1 ms 5212 KB Output is correct
13 Correct 2 ms 5212 KB Output is correct
14 Correct 2 ms 5468 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 1 ms 5212 KB Output is correct
17 Correct 2 ms 5292 KB Output is correct
18 Correct 2 ms 5212 KB Output is correct
19 Correct 1 ms 5212 KB Output is correct
20 Correct 2 ms 5468 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 1 ms 5212 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 2 ms 5468 KB Output is correct
25 Correct 2 ms 5468 KB Output is correct
26 Correct 1 ms 5212 KB Output is correct
27 Correct 1 ms 5212 KB Output is correct
28 Correct 2 ms 5468 KB Output is correct
29 Correct 3 ms 5468 KB Output is correct
30 Correct 2 ms 5468 KB Output is correct
31 Correct 2 ms 5308 KB Output is correct
32 Correct 2 ms 5468 KB Output is correct
33 Correct 4 ms 5976 KB Output is correct
34 Correct 3 ms 5724 KB Output is correct
35 Correct 10 ms 6748 KB Output is correct
36 Correct 2 ms 5468 KB Output is correct
37 Correct 9 ms 6492 KB Output is correct
38 Correct 10 ms 7004 KB Output is correct
39 Correct 9 ms 7004 KB Output is correct
40 Correct 8 ms 7000 KB Output is correct
41 Correct 9 ms 7004 KB Output is correct
42 Correct 4 ms 5468 KB Output is correct
43 Correct 5 ms 5468 KB Output is correct
44 Correct 4 ms 5468 KB Output is correct
45 Correct 13 ms 7268 KB Output is correct
46 Correct 12 ms 7260 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5208 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 1 ms 5212 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 5212 KB Output is correct
6 Correct 1 ms 5212 KB Output is correct
7 Correct 1 ms 5212 KB Output is correct
8 Correct 1 ms 5212 KB Output is correct
9 Correct 1 ms 5212 KB Output is correct
10 Correct 2 ms 5208 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 1 ms 5212 KB Output is correct
13 Correct 2 ms 5212 KB Output is correct
14 Correct 2 ms 5388 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 1 ms 5212 KB Output is correct
17 Correct 2 ms 5468 KB Output is correct
18 Correct 1 ms 5212 KB Output is correct
19 Correct 1 ms 5212 KB Output is correct
20 Correct 1 ms 5468 KB Output is correct
21 Correct 1 ms 5384 KB Output is correct
22 Correct 1 ms 5212 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 2 ms 5492 KB Output is correct
25 Correct 2 ms 5468 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 2 ms 5412 KB Output is correct
28 Correct 2 ms 5468 KB Output is correct
29 Correct 3 ms 5468 KB Output is correct
30 Correct 2 ms 5380 KB Output is correct
31 Correct 2 ms 5468 KB Output is correct
32 Correct 2 ms 5468 KB Output is correct
33 Correct 4 ms 5724 KB Output is correct
34 Correct 3 ms 5724 KB Output is correct
35 Correct 10 ms 6856 KB Output is correct
36 Correct 2 ms 5468 KB Output is correct
37 Correct 10 ms 6492 KB Output is correct
38 Correct 10 ms 7000 KB Output is correct
39 Correct 8 ms 7004 KB Output is correct
40 Correct 8 ms 7032 KB Output is correct
41 Correct 11 ms 7260 KB Output is correct
42 Correct 4 ms 5464 KB Output is correct
43 Correct 4 ms 5468 KB Output is correct
44 Correct 4 ms 5468 KB Output is correct
45 Correct 13 ms 7260 KB Output is correct
46 Correct 13 ms 7260 KB Output is correct
47 Correct 13 ms 7384 KB Output is correct
48 Correct 6 ms 6532 KB Output is correct
49 Correct 5 ms 6492 KB Output is correct
50 Correct 4 ms 6144 KB Output is correct
51 Correct 15 ms 7896 KB Output is correct
52 Correct 15 ms 7640 KB Output is correct
53 Correct 8 ms 7256 KB Output is correct
54 Correct 2 ms 5720 KB Output is correct
55 Correct 3 ms 5720 KB Output is correct
56 Correct 9 ms 7000 KB Output is correct
57 Correct 2 ms 5980 KB Output is correct
58 Correct 6 ms 5740 KB Output is correct
59 Correct 6 ms 5856 KB Output is correct
60 Correct 6 ms 5720 KB Output is correct
61 Correct 8 ms 6072 KB Output is correct
62 Correct 9 ms 7004 KB Output is correct
63 Correct 33 ms 9168 KB Output is correct
64 Correct 44 ms 9164 KB Output is correct
65 Correct 42 ms 9168 KB Output is correct
66 Correct 84 ms 12232 KB Output is correct
67 Correct 54 ms 12488 KB Output is correct