oj.uz

답안 #968721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968721 2024-04-23T23:32:58 Z idiotcomputer 다리 (APIO19_bridges) C++11
46 / 100
 3000 ms 7172 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second 
#define pb push_back
#define sz size 
 
const int mxN = 1e5;
 
struct edge {
    int a,b,w;
};
 
edge edges[mxN];
edge all[mxN];
int p[mxN];
int ssize[mxN];
int cnt[mxN];
int gsize;
stack<int> upd;
 
bool comp(int a, int b){
    return (edges[a].w > edges[b].w);
}
 
bool comp2(int a, int b){
    return all[a].w > all[b].w;
}
 
int gp(int a){
    while (p[a] != a) a = p[a];
    return a;
}

void group(int u, int v){
    u = gp(u);
    v = gp(v);
    if (u==v) return;
    if (ssize[u] < ssize[v]) swap(u,v);
    ssize[u] += ssize[v];
    p[v] = u;
    upd.push(v);
    return;
}
 
void reset(int a){
    int c;
    while (upd.sz() > a){
        c = upd.top();
        upd.pop();
        ssize[p[c]] -= ssize[c];
        p[c] = c;
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    memset(cnt,0,sizeof(cnt));
 
    int n,m;
    cin >> n >> m;
    
    for (int i =0; i < m; i++){
        cin >> edges[i].a >> edges[i].b >> edges[i].w;
        edges[i].a -= 1;
        edges[i].b -= 1;
    }
    
    int q;
    cin >> q;
    for (int i = 0; i < q; i++){
        cin >> all[i].a >> all[i].b >> all[i].w;
        all[i].b -= 1;
    }
    for (int i =0; i < n; i++){
        p[i] = i;
        ssize[i] = 1;
    }
    gsize = sqrt(q);
    vector<int> curre;
    vector<int> cvis;
    vector<int> ans;
    int cidx;
    int res[q];
    for (int i =0; i < q; i++) res[i] = -1;
  //  cout <<"GISZE " <<  gsize << "\n";
    for (int i =0; i < (int) ceil((double) q/gsize); i++){
        curre.clear();
        ans.clear();
        cvis.clear();
       /* cout << "W: ";
        for (int j = 0; j < m; j++) cout << edges[j].w << " ";
        cout << '\n';*/
        for (int j = min(q,(i+1)*gsize)-1; j >= i*gsize; j--){
            if (all[j].a == 1 && cnt[all[j].b] != i+1){
                cnt[all[j].b] = i+1;
                cvis.pb(j);
            } else {
                ans.pb(j);
            }
        }
        for (int j = 0; j < m; j++) if (cnt[j] != i+1) curre.pb(j);
        sort(curre.begin(),curre.end(),comp);
        sort(ans.begin(),ans.end(),comp2);
       /*cout << i << ":\n";
        for (int j : curre) cout << j << " ";
        cout << '\n';
        for (int j : ans) cout << j << " ";
        cout << "\n";*/
        
        cidx = 0;
        int u,v;
        for (int j = 0; j < ans.sz(); j++){
            //Adding on non-changing edges
         //   cout << j <<" - "; 
            while (cidx < curre.sz() && edges[curre[cidx]].w >= all[ans[j]].w){
           //    cout << curre[cidx] << " ";
                group(edges[curre[cidx]].a,edges[curre[cidx]].b);
                cidx++;
            }
      //      cout << " 2 ";
            for (int k = ans[j]-1; k >= i*gsize; k--){
                if (all[k].a == 2 || cnt[all[k].b] == q+i+1) continue;
                cnt[all[k].b] = q+i+1;
                if (all[k].w < all[ans[j]].w) continue;
                //    cout << all[k].b << " ";
                group(edges[all[k].b].a,edges[all[k].b].b);
            }
       //     cout << " 3 ";
            for (int k : cvis){
                if (cnt[all[k].b] == q+i+1 || edges[all[k].b].w < all[ans[j]].w){
                    cnt[all[k].b] = i+1;
                    continue;
                }
             //   cout << all[k].b << " ";
                group(edges[all[k].b].a,edges[all[k].b].b);
            }
          // cout << '\n';
            int c = all[ans[j]].b;
            c = gp(c);
            res[ans[j]] = ssize[c];
            reset(cidx);
        }
        reset(0);
        for (int j : cvis) edges[all[j].b].w = all[j].w;
    }
    
    for (int i =0; i < q; i++){
        if (all[i].a == 1) continue;
        cout << res[i] << "\n";
        if (res[i] == -1) while (true) continue;
    }
 
    return 0;
}

Compilation message

bridges.cpp: In function 'void reset(int)':
bridges.cpp:49:21: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |     while (upd.sz() > a){
      |            ~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:116:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         for (int j = 0; j < ans.sz(); j++){
      |                         ~~^~~~~~~~~~
bridges.cpp:119:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |             while (cidx < curre.sz() && edges[curre[cidx]].w >= all[ans[j]].w){
      |                    ~~~~~^~~~~~~~~~~~
bridges.cpp:115:13: warning: unused variable 'u' [-Wunused-variable]
  115 |         int u,v;
      |             ^
bridges.cpp:115:15: warning: unused variable 'v' [-Wunused-variable]
  115 |         int u,v;
      |               ^

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Incorrect 15 ms 2652 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2328 ms 4184 KB Output is correct
2 Correct 2401 ms 6924 KB Output is correct
3 Correct 2377 ms 6924 KB Output is correct
4 Correct 2293 ms 6980 KB Output is correct
5 Correct 2333 ms 6976 KB Output is correct
6 Correct 2517 ms 6992 KB Output is correct
7 Correct 2497 ms 6988 KB Output is correct
8 Correct 2499 ms 7024 KB Output is correct
9 Correct 37 ms 4696 KB Output is correct
10 Correct 1086 ms 5808 KB Output is correct
11 Correct 1138 ms 5804 KB Output is correct
12 Correct 2376 ms 6900 KB Output is correct
13 Correct 2355 ms 6900 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1486 ms 3832 KB Output is correct
2 Correct 419 ms 4908 KB Output is correct
3 Correct 1454 ms 5972 KB Output is correct
4 Correct 1549 ms 6236 KB Output is correct
5 Correct 37 ms 4692 KB Output is correct
6 Correct 1532 ms 6112 KB Output is correct
7 Correct 1432 ms 6128 KB Output is correct
8 Correct 1423 ms 6144 KB Output is correct
9 Correct 1390 ms 6484 KB Output is correct
10 Correct 1389 ms 6140 KB Output is correct
11 Correct 1362 ms 6116 KB Output is correct
12 Correct 1453 ms 6128 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3045 ms 4784 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2328 ms 4184 KB Output is correct
2 Correct 2401 ms 6924 KB Output is correct
3 Correct 2377 ms 6924 KB Output is correct
4 Correct 2293 ms 6980 KB Output is correct
5 Correct 2333 ms 6976 KB Output is correct
6 Correct 2517 ms 6992 KB Output is correct
7 Correct 2497 ms 6988 KB Output is correct
8 Correct 2499 ms 7024 KB Output is correct
9 Correct 37 ms 4696 KB Output is correct
10 Correct 1086 ms 5808 KB Output is correct
11 Correct 1138 ms 5804 KB Output is correct
12 Correct 2376 ms 6900 KB Output is correct
13 Correct 2355 ms 6900 KB Output is correct
14 Correct 1486 ms 3832 KB Output is correct
15 Correct 419 ms 4908 KB Output is correct
16 Correct 1454 ms 5972 KB Output is correct
17 Correct 1549 ms 6236 KB Output is correct
18 Correct 37 ms 4692 KB Output is correct
19 Correct 1532 ms 6112 KB Output is correct
20 Correct 1432 ms 6128 KB Output is correct
21 Correct 1423 ms 6144 KB Output is correct
22 Correct 1390 ms 6484 KB Output is correct
23 Correct 1389 ms 6140 KB Output is correct
24 Correct 1362 ms 6116 KB Output is correct
25 Correct 1453 ms 6128 KB Output is correct
26 Correct 2336 ms 6936 KB Output is correct
27 Correct 2471 ms 6736 KB Output is correct
28 Correct 2431 ms 7096 KB Output is correct
29 Correct 2398 ms 7124 KB Output is correct
30 Correct 2452 ms 6804 KB Output is correct
31 Correct 2446 ms 6768 KB Output is correct
32 Correct 2473 ms 6776 KB Output is correct
33 Correct 2368 ms 6984 KB Output is correct
34 Correct 2367 ms 6976 KB Output is correct
35 Correct 2395 ms 6972 KB Output is correct
36 Correct 2296 ms 6912 KB Output is correct
37 Correct 2294 ms 7044 KB Output is correct
38 Correct 2305 ms 7164 KB Output is correct
39 Correct 2312 ms 6936 KB Output is correct
40 Correct 2341 ms 7172 KB Output is correct
41 Correct 2325 ms 6920 KB Output is correct
42 Correct 2202 ms 6900 KB Output is correct
43 Correct 2224 ms 6884 KB Output is correct
44 Correct 2224 ms 6888 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Incorrect 15 ms 2652 KB Output isn't correct
4 Halted 0 ms 0 KB -