oj.uz

Submission #641746

# Submission time Handle Problem Language Result Execution time Memory
641746 2022-09-17T14:20:57 Z pls33 Trucks (LMIO17_sunkvezimiai) C++17
100 / 100
 157 ms 15172 KB 
#include <bits/stdc++.h>

using namespace std;

using p32 = pair<int, int>;
using p64 = pair<int64_t, int64_t>;
using vi16 = vector<int16_t>;
using vi32 = vector<int>;
using vi64 = vector<int64_t>;
using vp32 = vector<p32>;
using vp64 = vector<p64>;
using vvi32 = vector<vi32>;
using vvi64 = vector<vi64>;
using vvp32 = vector<vp32>;
using vvp64 = vector<vp64>;


struct edge {
    int a, b;
    int time;
};

struct query : public edge {
    int pos;
};

int find_set(int a, vi32 &parents){
    if(a != parents[a]){
        parents[a] = find_set(parents[a], parents);
    }

    return parents[a];
}

void unite_sets(int a, int b, vi32 &parents, vi32 &ranks){
    a = find_set(a, parents);
    b = find_set(b, parents);

    if(a == b){
        return;
    }

    if(ranks[a] < ranks[b]){
        swap(a, b);
    }

    parents[b] = a;
    ranks[a] += ranks[b];
}


int eval_query(query &q, vi32 &parents, vi32 &ranks,
    int &prev_edge, vector<edge> &edges)
{
    if(find_set(q.a, parents) == find_set(q.b, parents)){
        return 1;
    }

    auto last_iter = upper_bound(edges.begin() + prev_edge, edges.end(), q, 
    [](const edge &a, const edge &b)
    {
        return a.time < b.time;
    });

    int last_edge = min(int(last_iter - edges.begin()), int(edges.size()));

    if(last_edge <= prev_edge){
        return 0;
    }

    for(int i = prev_edge; i < last_edge; i++){
        unite_sets(edges[i].a, edges[i].b, parents, ranks);
    }
    
    prev_edge = last_edge;
    return find_set(q.a, parents) == find_set(q.b, parents);
}

int main()
{
    #ifndef _AAAAAAAAA
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #else
    freopen("sunk.in", "r", stdin);
    #endif

    int cities, roads, queries;
    cin >> cities >> roads >> queries;

    vector<edge> e(roads);
    for(int i = 0; i < roads; i++){
        cin >> e[i].a >> e[i].b >> e[i].time;

        e[i].a--;
        e[i].b--;
    }

    vector<query> q(queries);
    for(int i = 0; i < queries; i++){
        int a, b, time;
        cin >> q[i].a >> q[i].b >> q[i].time;

        q[i].a--;
        q[i].b--;
        q[i].pos = i;
    }

    sort(e.begin(), e.end(), [](edge &a, edge &b)
    {
        return a.time < b.time;
    });

    sort(q.begin(), q.end(), [](query &a, query &b)
    {
        return a.time < b.time;
    });

    vi32 ranks(cities, 1);
    vi32 parents(cities);
    iota(parents.begin(), parents.end(), 0);

    int last_edge = 0;
    for(auto &a : q){
        a.a = eval_query(a, parents, ranks, last_edge, e);
    }

    sort(q.begin(), q.end(), [](query &a, query &b)
    {
        return a.pos < b.pos;
    });

    for(auto &a : q){
        if(a.a){
            cout << "TAIP" << '\n';
        }
        else {
            cout << "NE" << '\n';
        }
    }

    return 0;
}

Compilation message

sunkvezimiai.cpp: In function 'int main()':
sunkvezimiai.cpp:101:13: warning: unused variable 'a' [-Wunused-variable]
  101 |         int a, b, time;
      |             ^
sunkvezimiai.cpp:101:16: warning: unused variable 'b' [-Wunused-variable]
  101 |         int a, b, time;
      |                ^
sunkvezimiai.cpp:101:19: warning: unused variable 'time' [-Wunused-variable]
  101 |         int a, b, time;
      |                   ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 77 ms 6896 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 7 ms 980 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 940 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 388 KB Output is correct
18 Correct 2 ms 328 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 5 ms 588 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 388 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 2 ms 456 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 5 ms 588 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 77 ms 6896 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 7 ms 980 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 6 ms 940 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 388 KB Output is correct
18 Correct 2 ms 328 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 5 ms 588 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 77 ms 6896 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 7 ms 980 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 6 ms 940 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 388 KB Output is correct
18 Correct 2 ms 328 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 5 ms 588 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 77 ms 6896 KB Output is correct
27 Correct 157 ms 15172 KB Output is correct
28 Correct 15 ms 1184 KB Output is correct
29 Correct 10 ms 1236 KB Output is correct
30 Correct 15 ms 1616 KB Output is correct
31 Correct 13 ms 1564 KB Output is correct
32 Correct 9 ms 1096 KB Output is correct
33 Correct 117 ms 11648 KB Output is correct
34 Correct 12 ms 1448 KB Output is correct
35 Correct 117 ms 14816 KB Output is correct