oj.uz

Submission #209592

# Submission time Handle Problem Language Result Execution time Memory
209592 2020-03-14T18:25:06 Z gratus907 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 275 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define usecppio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) ((x).begin()),((x).end())

#define int ll
using pii = pair <int, int>;
#define INF 0x7f7f7f7f7f7f7f7f
const bool debug = false;
const int MX = 30202;

struct Edge
{
    int dest, w;
    bool operator<(const Edge &p) const
    {
        return w > p.w;
    }
};

bool relax(Edge edge, int u, int dist[])
{
    bool flag = 0;
    int v = edge.dest, w = edge.w;
    if (dist[v] > dist[u] + w && (dist[u]!=INF))
    {
        flag = true;
        dist[v] = dist[u]+w;
    }
    return flag;
}

void dijkstra(int dist[], int start, vector<Edge> graph[])
{
    fill(dist,dist+MX,INF);
    dist[start] = 0;
    priority_queue<Edge> pq;
    pq.push({start,0});
    while(!pq.empty())
    {
        Edge x = pq.top();
        int v = x.dest, w = x.w;
        pq.pop();
        if (w>dist[v])
            continue;
        for (auto ed : graph[v])
            if (relax(ed, v, dist))
                pq.push({ed.dest,dist[ed.dest]});
    }
}
struct doge
{
    int start, power, index;
};
int n, m;
vector <int> bi(30303, 0), pi(30303, 0);
vector <Edge> G[30303];
bitset <30303> mark[30303];
vector <doge> alldoge[30303];
vector <doge> dogeinfo;
int distances[30303];
bool visit[30303];
bool dogevisit[30303];
void print_graph()
{
    for (int i = 0; i<n; i++)
    {
        for (auto it:G[i])
            printf("From %lld to %lld, %lld\n",i, it.dest, it.w);
    }
}
void dfs(doge curdoge)
{
    dogevisit[curdoge.index] = true;
    for (auto it:alldoge[curdoge.start])
        if (!dogevisit[it.index])
            dfs(it);
    for (int i = 1; ;i++)
    {
        int u = curdoge.start+i*curdoge.power;
        if (u >= n)
            break;
        bool check = false;
        if (!visit[u])
        {
            visit[u] = true;
            for (auto it:alldoge[u])
            {
                if (!dogevisit[it.index])
                {
                    if (it.power == curdoge.power)
                        check = true;
                    dfs(it);
                }
            }
        }
        G[curdoge.start].push_back({u,i});
        if (check)
            break;
    }
    for (int i = -1; ;i--)
    {
        int u = curdoge.start+i*curdoge.power;
        if (u < 0)
            break;
        bool check = false;
        if (!visit[u])
        {
            visit[u] = true;
            for (auto it:alldoge[u])
            {
                if (!dogevisit[it.index])
                {
                    if (it.power == curdoge.power)
                        check = true;
                    dfs(it);
                }
            }
        }
        G[curdoge.start].push_back({u,-i});
        if (check) break;
    }
}
int32_t main()
{
    usecppio
    cin >> n >> m;
    for (int i = 0; i<m; i++)
    {
        cin >> bi[i] >> pi[i];
        if (!mark[bi[i]][pi[i]] && i!=1)
        {
            mark[bi[i]][pi[i]] = true;
            alldoge[bi[i]].push_back({bi[i], pi[i], i});
        }
        dogeinfo.push_back({bi[i], pi[i], i});
    }
    dogevisit[0] = true;
    visit[dogeinfo[0].start] = 1;
    dfs(dogeinfo[0]);
    //print_graph();
    dijkstra(distances,bi[0],G);
    if (distances[bi[1]] >= 10000000)
    {
        printf("-1");
    }
    else printf("%lld\n",distances[bi[1]]);

}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2424 KB Output is correct
2 Correct 6 ms 2424 KB Output is correct
3 Correct 6 ms 2552 KB Output is correct
4 Correct 6 ms 2424 KB Output is correct
5 Correct 6 ms 2424 KB Output is correct
6 Correct 6 ms 2552 KB Output is correct
7 Correct 6 ms 2552 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2552 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 7 ms 3448 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 6 ms 3064 KB Output is correct
14 Correct 7 ms 2936 KB Output is correct
15 Correct 9 ms 2936 KB Output is correct
16 Correct 7 ms 3320 KB Output is correct
17 Correct 9 ms 5880 KB Output is correct
18 Correct 8 ms 5496 KB Output is correct
19 Correct 9 ms 4472 KB Output is correct
20 Correct 59 ms 49400 KB Output is correct
21 Correct 7 ms 3960 KB Output is correct
22 Correct 8 ms 4856 KB Output is correct
23 Correct 9 ms 5496 KB Output is correct
24 Correct 11 ms 7544 KB Output is correct
25 Correct 11 ms 7672 KB Output is correct
26 Correct 7 ms 3064 KB Output is correct
27 Correct 7 ms 3064 KB Output is correct
28 Correct 13 ms 10616 KB Output is correct
29 Correct 8 ms 4088 KB Output is correct
30 Correct 7 ms 3192 KB Output is correct
31 Correct 7 ms 3576 KB Output is correct
32 Correct 7 ms 3320 KB Output is correct
33 Correct 10 ms 5364 KB Output is correct
34 Correct 10 ms 5236 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2428 KB Output is correct
2 Correct 6 ms 2552 KB Output is correct
3 Correct 6 ms 2552 KB Output is correct
4 Correct 6 ms 2552 KB Output is correct
5 Correct 6 ms 2424 KB Output is correct
6 Correct 6 ms 2424 KB Output is correct
7 Correct 7 ms 2552 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2552 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 7 ms 3448 KB Output is correct
12 Correct 7 ms 2552 KB Output is correct
13 Correct 7 ms 3064 KB Output is correct
14 Correct 7 ms 2936 KB Output is correct
15 Correct 7 ms 2936 KB Output is correct
16 Correct 7 ms 3320 KB Output is correct
17 Correct 9 ms 5880 KB Output is correct
18 Correct 8 ms 5496 KB Output is correct
19 Correct 8 ms 4472 KB Output is correct
20 Correct 61 ms 49404 KB Output is correct
21 Correct 7 ms 3964 KB Output is correct
22 Correct 8 ms 4860 KB Output is correct
23 Correct 10 ms 5496 KB Output is correct
24 Correct 11 ms 7672 KB Output is correct
25 Correct 10 ms 7544 KB Output is correct
26 Correct 7 ms 3064 KB Output is correct
27 Correct 7 ms 3064 KB Output is correct
28 Correct 12 ms 10616 KB Output is correct
29 Correct 8 ms 4088 KB Output is correct
30 Correct 7 ms 3192 KB Output is correct
31 Correct 8 ms 3576 KB Output is correct
32 Correct 7 ms 3320 KB Output is correct
33 Correct 10 ms 5364 KB Output is correct
34 Correct 10 ms 5236 KB Output is correct
35 Correct 26 ms 16432 KB Output is correct
36 Correct 11 ms 7544 KB Output is correct
37 Correct 28 ms 20400 KB Output is correct
38 Correct 32 ms 21552 KB Output is correct
39 Correct 33 ms 21936 KB Output is correct
40 Correct 32 ms 21680 KB Output is correct
41 Correct 32 ms 21424 KB Output is correct
42 Correct 12 ms 3832 KB Output is correct
43 Correct 11 ms 3700 KB Output is correct
44 Correct 65 ms 49144 KB Output is correct
45 Correct 29 ms 13488 KB Output is correct
46 Correct 29 ms 13488 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2552 KB Output is correct
2 Correct 6 ms 2556 KB Output is correct
3 Correct 6 ms 2552 KB Output is correct
4 Correct 6 ms 2552 KB Output is correct
5 Correct 6 ms 2428 KB Output is correct
6 Correct 6 ms 2552 KB Output is correct
7 Correct 6 ms 2424 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2552 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 7 ms 3448 KB Output is correct
12 Correct 6 ms 2680 KB Output is correct
13 Correct 6 ms 3064 KB Output is correct
14 Correct 7 ms 3064 KB Output is correct
15 Correct 7 ms 2940 KB Output is correct
16 Correct 7 ms 3320 KB Output is correct
17 Correct 9 ms 5880 KB Output is correct
18 Correct 8 ms 5624 KB Output is correct
19 Correct 7 ms 4476 KB Output is correct
20 Correct 58 ms 49400 KB Output is correct
21 Correct 7 ms 3960 KB Output is correct
22 Correct 8 ms 4856 KB Output is correct
23 Correct 9 ms 5624 KB Output is correct
24 Correct 11 ms 7544 KB Output is correct
25 Correct 12 ms 7540 KB Output is correct
26 Correct 7 ms 3064 KB Output is correct
27 Correct 7 ms 3064 KB Output is correct
28 Correct 13 ms 10616 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 7 ms 3192 KB Output is correct
31 Correct 8 ms 3576 KB Output is correct
32 Correct 7 ms 3320 KB Output is correct
33 Correct 10 ms 5368 KB Output is correct
34 Correct 10 ms 5236 KB Output is correct
35 Correct 26 ms 16432 KB Output is correct
36 Correct 12 ms 7544 KB Output is correct
37 Correct 28 ms 20400 KB Output is correct
38 Correct 32 ms 21552 KB Output is correct
39 Correct 32 ms 21936 KB Output is correct
40 Correct 32 ms 21680 KB Output is correct
41 Correct 32 ms 21424 KB Output is correct
42 Correct 11 ms 3704 KB Output is correct
43 Correct 11 ms 3700 KB Output is correct
44 Correct 64 ms 49144 KB Output is correct
45 Correct 29 ms 13488 KB Output is correct
46 Correct 28 ms 13488 KB Output is correct
47 Correct 87 ms 70192 KB Output is correct
48 Correct 56 ms 59440 KB Output is correct
49 Correct 54 ms 59568 KB Output is correct
50 Correct 43 ms 48692 KB Output is correct
51 Correct 107 ms 88112 KB Output is correct
52 Correct 105 ms 88368 KB Output is correct
53 Correct 77 ms 78640 KB Output is correct
54 Correct 8 ms 3196 KB Output is correct
55 Correct 8 ms 3316 KB Output is correct
56 Runtime error 275 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -