oj.uz

Submission #960159

# Submission time Handle Problem Language Result Execution time Memory
960159 2024-04-09T18:44:06 Z hariaakas646 Bridges (APIO19_bridges) C++14
59 / 100
 3000 ms 9240 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;


void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

vi disset, sze, cnt, out;
stack<pii> stk;
int n, m;

int findf(int x) {
    while(x != disset[x]) {
        x = disset[x];
    }
    return x;
}

void unionf(int u, int v) {
    u = findf(u);
    v = findf(v);
    if(u == v) return;
    if(sze[u] > sze[v]) swap(u, v);
    disset[u] = v;
    sze[v] = max(sze[v], sze[u]+1);
    stk.push(mp(u, v));
    cnt[v] += cnt[u];
}

vector<pair<int, pii>> edge;

void process(vector<pair<pii, pii>> quer) {
    vb change(m);
    stk = {};
    vector<pair<pii, int>> calc;
    vector<pair<pii, int>> upd;
    vvi uped(m);
    disset = vi(n+1);
    forr(i, 1, n+1) disset[i] = i;
    sze = cnt= vi(n+1, 1);
    for(auto p : quer) {

        if(p.f.s == 1) {
            // printf("%d\n", p.s.s);
            change[p.s.s] = true;
            upd.pb(mp(p.s, p.f.f));
            uped[p.s.s].pb(p.f.f);
        }
        else calc.pb(mp(p.s, p.f.f));
    }
    // upd.pb(mp(mp(0, 0), 1e6));
    sort(all(calc), greater<>());

    vector<pair<int, pii>> st;
    frange(i, m) {
        auto p = edge[i];
        if(!change[i])
            st.pb(p);
    }
    sort(all(st));
    // printf("upd:\n");
    // for(auto p1 : upd) {
        
    //     printf("%d %d\n", edge[p1.f.s].s.f, edge[p1.f.s].s.s);
    // }
    // printf("std:\n");
    // for(auto p1 : st) {
        
    //     printf("%d %d\n", p1.s.f, p1.s.s);
    // }
    int it = st.size();
    for(auto p : calc) {
        // printf("%d:\n", p.s);
        stk = {};
        frange(i, upd.size()) {
            auto p1 = upd[i];
            int v = edge[p1.f.s].f;
            auto it = lower_bound(all(uped[p1.f.s]), p1.s);
            if(p1.s < p.s) v = p1.f.f;
            else if(it > uped[p1.f.s].begin()) continue;
            if(next(it) != uped[p1.f.s].end() && *next(it) < p.s) continue;
            if(v >= p.f.f) {
                unionf(edge[p1.f.s].s.f, edge[p1.f.s].s.s);
                // printf("upd %d %d\n", edge[p1.f.s].s.f, edge[p1.f.s].s.s);
            }
        }
        auto it1 = it;
        while(it != 0 && st[it-1].f >= p.f.f) {
            it--;
            auto p1 = st[it];
            unionf(p1.s.f, p1.s.s);
            // printf("std %d %d\n", p1.s.f, p1.s.s);
            
        }
        out[p.s] = cnt[findf(p.f.s)];
        while(stk.size()) {
            auto p1 = stk.top();
            stk.pop();
            disset[p1.f] = p1.f;
            cnt[p1.s] -= cnt[p1.f];
        }

        
        it = it1;
        while(it != 0 && st[it-1].f >= p.f.f) {
            it--;
            auto p1 = st[it];
            unionf(p1.s.f, p1.s.s);
        }
    }

    for(auto p : upd) {
        edge[p.f.s].f = p.f.f;
    }

}

int main() {
    // usaco();
    scd(n);
    scd(m);
    edge = vector<pair<int, pii>>(m);

    frange(i, m) {
        scd(edge[i].s.f);
        scd(edge[i].s.s);
        scd(edge[i].f);
    }

    int q;
    scd(q);

    int sq = sqrt(q);

    vector<pair<pii, pii>> quer;
    out = vi(q, -1);
    frange(i, q) {
        pair<pii, pii> p;
        p.f.f = i;
        scd(p.f.s);
        scd(p.s.s);
        scd(p.s.f);
        if(p.f.s == 1) p.s.s--;
        quer.pb(p);
        if(quer.size() >= sq) {
            process(quer);
            quer = {};
        }
    }
    process(quer);

    for(auto e : out) if(e != -1) {printf("%d\n", e);}


}

Compilation message

bridges.cpp: In function 'void process(std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >)':
bridges.cpp:7:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define forr(i, j, k) for (int i = j; i < k; i++)
      |                                         ^
bridges.cpp:8:22: note: in expansion of macro 'forr'
    8 | #define frange(i, j) forr(i, 0, j)
      |                      ^~~~
bridges.cpp:101:9: note: in expansion of macro 'frange'
  101 |         frange(i, upd.size()) {
      |         ^~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:171:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  171 |         if(quer.size() >= sq) {
      |            ~~~~~~~~~~~~^~~~~
bridges.cpp: In function 'void usaco()':
bridges.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:146:5: note: in expansion of macro 'scd'
  146 |     scd(n);
      |     ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:147:5: note: in expansion of macro 'scd'
  147 |     scd(m);
      |     ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:151:9: note: in expansion of macro 'scd'
  151 |         scd(edge[i].s.f);
      |         ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:152:9: note: in expansion of macro 'scd'
  152 |         scd(edge[i].s.s);
      |         ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:153:9: note: in expansion of macro 'scd'
  153 |         scd(edge[i].f);
      |         ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:157:5: note: in expansion of macro 'scd'
  157 |     scd(q);
      |     ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:166:9: note: in expansion of macro 'scd'
  166 |         scd(p.f.s);
      |         ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:167:9: note: in expansion of macro 'scd'
  167 |         scd(p.s.s);
      |         ^~~
bridges.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
bridges.cpp:168:9: note: in expansion of macro 'scd'
  168 |         scd(p.s.f);
      |         ^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 15 ms 540 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 9 ms 348 KB Output is correct
14 Correct 9 ms 348 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 8 ms 484 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1934 ms 5028 KB Output is correct
2 Correct 2001 ms 7288 KB Output is correct
3 Correct 1927 ms 7664 KB Output is correct
4 Correct 1956 ms 7716 KB Output is correct
5 Correct 1938 ms 7568 KB Output is correct
6 Correct 2043 ms 7932 KB Output is correct
7 Correct 2013 ms 7832 KB Output is correct
8 Correct 2021 ms 7836 KB Output is correct
9 Correct 37 ms 2504 KB Output is correct
10 Correct 1721 ms 6428 KB Output is correct
11 Correct 1742 ms 6756 KB Output is correct
12 Correct 1901 ms 7844 KB Output is correct
13 Correct 1911 ms 7696 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1321 ms 3240 KB Output is correct
2 Correct 439 ms 3300 KB Output is correct
3 Correct 1392 ms 5424 KB Output is correct
4 Correct 1314 ms 5628 KB Output is correct
5 Correct 36 ms 2396 KB Output is correct
6 Correct 1356 ms 5624 KB Output is correct
7 Correct 1305 ms 5760 KB Output is correct
8 Correct 1300 ms 5540 KB Output is correct
9 Correct 1211 ms 5960 KB Output is correct
10 Correct 1219 ms 5576 KB Output is correct
11 Correct 1246 ms 5576 KB Output is correct
12 Correct 1229 ms 5824 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3061 ms 7700 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1934 ms 5028 KB Output is correct
2 Correct 2001 ms 7288 KB Output is correct
3 Correct 1927 ms 7664 KB Output is correct
4 Correct 1956 ms 7716 KB Output is correct
5 Correct 1938 ms 7568 KB Output is correct
6 Correct 2043 ms 7932 KB Output is correct
7 Correct 2013 ms 7832 KB Output is correct
8 Correct 2021 ms 7836 KB Output is correct
9 Correct 37 ms 2504 KB Output is correct
10 Correct 1721 ms 6428 KB Output is correct
11 Correct 1742 ms 6756 KB Output is correct
12 Correct 1901 ms 7844 KB Output is correct
13 Correct 1911 ms 7696 KB Output is correct
14 Correct 1321 ms 3240 KB Output is correct
15 Correct 439 ms 3300 KB Output is correct
16 Correct 1392 ms 5424 KB Output is correct
17 Correct 1314 ms 5628 KB Output is correct
18 Correct 36 ms 2396 KB Output is correct
19 Correct 1356 ms 5624 KB Output is correct
20 Correct 1305 ms 5760 KB Output is correct
21 Correct 1300 ms 5540 KB Output is correct
22 Correct 1211 ms 5960 KB Output is correct
23 Correct 1219 ms 5576 KB Output is correct
24 Correct 1246 ms 5576 KB Output is correct
25 Correct 1229 ms 5824 KB Output is correct
26 Correct 2166 ms 7532 KB Output is correct
27 Correct 2177 ms 7328 KB Output is correct
28 Correct 2131 ms 7656 KB Output is correct
29 Correct 2088 ms 7568 KB Output is correct
30 Correct 2122 ms 7556 KB Output is correct
31 Correct 2147 ms 7416 KB Output is correct
32 Correct 2175 ms 7452 KB Output is correct
33 Correct 2027 ms 7440 KB Output is correct
34 Correct 2080 ms 7564 KB Output is correct
35 Correct 2075 ms 7544 KB Output is correct
36 Correct 2015 ms 7484 KB Output is correct
37 Correct 2005 ms 7640 KB Output is correct
38 Correct 1987 ms 7616 KB Output is correct
39 Correct 1963 ms 7632 KB Output is correct
40 Correct 1931 ms 9240 KB Output is correct
41 Correct 1936 ms 7704 KB Output is correct
42 Correct 1820 ms 7624 KB Output is correct
43 Correct 1872 ms 7408 KB Output is correct
44 Correct 1813 ms 7520 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 15 ms 540 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 9 ms 348 KB Output is correct
14 Correct 9 ms 348 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 8 ms 484 KB Output is correct
18 Correct 1934 ms 5028 KB Output is correct
19 Correct 2001 ms 7288 KB Output is correct
20 Correct 1927 ms 7664 KB Output is correct
21 Correct 1956 ms 7716 KB Output is correct
22 Correct 1938 ms 7568 KB Output is correct
23 Correct 2043 ms 7932 KB Output is correct
24 Correct 2013 ms 7832 KB Output is correct
25 Correct 2021 ms 7836 KB Output is correct
26 Correct 37 ms 2504 KB Output is correct
27 Correct 1721 ms 6428 KB Output is correct
28 Correct 1742 ms 6756 KB Output is correct
29 Correct 1901 ms 7844 KB Output is correct
30 Correct 1911 ms 7696 KB Output is correct
31 Correct 1321 ms 3240 KB Output is correct
32 Correct 439 ms 3300 KB Output is correct
33 Correct 1392 ms 5424 KB Output is correct
34 Correct 1314 ms 5628 KB Output is correct
35 Correct 36 ms 2396 KB Output is correct
36 Correct 1356 ms 5624 KB Output is correct
37 Correct 1305 ms 5760 KB Output is correct
38 Correct 1300 ms 5540 KB Output is correct
39 Correct 1211 ms 5960 KB Output is correct
40 Correct 1219 ms 5576 KB Output is correct
41 Correct 1246 ms 5576 KB Output is correct
42 Correct 1229 ms 5824 KB Output is correct
43 Execution timed out 3061 ms 7700 KB Time limit exceeded
44 Halted 0 ms 0 KB -