oj.uz

답안 #649067

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
649067 2022-10-09T01:41:15 Z ToroTN 다리 (APIO19_bridges) C++14
100 / 100
 2505 ms 15696 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target ("sse4")
#define X first
#define Y second
#define pb push_back
set<pair<int,int> > s;
vector<pair<int,int> > g;
vector<tuple<int,int,int> > answer;
stack<pair<int,int> > stk;
int n,m,num=1200,t,u[100005],v[100005],w[100005],e[100005];
int op[100005],a[100005],b[100005],mx=-1,group[100005],it1,it2;
int p[50005],sz[50005],e2[100005],ans[100005],hsh[100005];
int l,r,pasin,nathan,bothtoq,uaytaq;
int f(int a)
{
    while(p[a]!=a)a=p[a];
    return a;
}
stack<int> sack;
void un(int b,int c)
{
    if(b>c)swap(b,c);
    sz[c]+=sz[b];
    p[b]=c;
}
void rollback(int x) {
	while (sack.size() > x) {
		int k = sack.top();
		sack.pop();
		sz[p[k]] -= sz[k];
		p[k] = k;
	}
}

void iterate()
{
    for(auto it=s.begin();it!=s.end();it++)
    {
        printf("krit=%d %d\n",(*it).X,(*it).Y);
    }
    printf("\n");
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&u[i],&v[i],&w[i]);
        e[i]=w[i];
        s.insert({e[i],i});
    }
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        scanf("%d%d%d",&op[i],&a[i],&b[i]);
        group[i]=(i-1)/num+1;
        mx=max(mx,group[i]);
    }
    for(int i=1;i<=mx;i++)
    {
        l=(i-1)*num+1;
        r=min(t,i*num);
        g.clear();
        answer.clear();
        if(s.size()!=0)
        for(auto it=s.begin();it!=s.end();it++)
        {
            stk.push({(*it).X,(*it).Y});
        }
        while(!stk.empty())
        {
            g.pb({stk.top().X,stk.top().Y});
            stk.pop();
        }
        for(int j=1;j<=m;j++)hsh[j]=0;
        for(int j=l;j<=r;j++)
        {
            if(op[j]==2)
            {
                answer.pb({b[j],a[j],j});
            }else ++hsh[a[j]];
        }
        sort(answer.rbegin(),answer.rend());
        it1=0,it2=0;
        for(int j=1;j<=n;j++)p[j]=j,sz[j]=1;
        for(int j=1;j<=m;j++)e2[j]=e[j];
        while(it2<(int)answer.size())
        {
            auto [w2,node,idx]=answer[it2];
            if(it1<(int)g.size())
            {
                int w=g[it1].X,edge=g[it1].Y;
                if(w>=w2)
                {
                    ///////////
                    bothtoq=f(u[edge]);
                    uaytaq=f(v[edge]);
                    if(bothtoq!=uaytaq&&hsh[edge]==0)
                    {
                        un(bothtoq,uaytaq);
                    }
                    //////////
                    ++it1;
                    continue;
                }
            }
            for(int j=l;j<=r;j++)
            {
                if(op[j]==1&&j<idx)
                {
                    e2[a[j]]=b[j];
                }
            }
            for(int j=l;j<=r;j++)
            {
                if(op[j]==1)
                {
                    if(e2[a[j]]>=b[idx])
                    {
                        pasin=f(u[a[j]]);
                        nathan=f(v[a[j]]);
                        if(pasin!=nathan)
                        {
                            if(sz[pasin]>sz[nathan])swap(pasin,nathan);
                            sack.push(pasin);
                            sz[nathan]+=sz[pasin];
                            p[pasin]=nathan;
                        }
                    }
                }
            }
            ans[idx]=sz[f(node)];
            for(int j=l;j<=r;j++)
            {
                if(op[j]==1&&j<idx)e2[a[j]]=e[a[j]];
            }
            while(!sack.empty())
            {
                sz[p[sack.top()]]-=sz[sack.top()];
                p[sack.top()]=sack.top();
                sack.pop();
            }
            ++it2;
        }
        for(int j=l;j<=r;j++)
        {
            if(op[j]==1)
            {
                if(s.find({e[a[j]],a[j]})!=s.end())
                {
                    s.erase(s.find({e[a[j]],a[j]}));
                }
                e[a[j]]=b[j];
                s.insert({e[a[j]],a[j]});
            }
        }
    }
    for(int i=1;i<=t;i++)
    {
        if(op[i]==2)printf("%d\n",ans[i]);
    }
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:29:21: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |  while (sack.size() > x) {
      |         ~~~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:91:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   91 |             auto [w2,node,idx]=answer[it2];
      |                  ^
bridges.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
bridges.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         scanf("%d%d%d",&u[i],&v[i],&w[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     scanf("%d",&t);
      |     ~~~~~^~~~~~~~~
bridges.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         scanf("%d%d%d",&op[i],&a[i],&b[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 73 ms 724 KB Output is correct
4 Correct 17 ms 468 KB Output is correct
5 Correct 75 ms 556 KB Output is correct
6 Correct 59 ms 468 KB Output is correct
7 Correct 77 ms 536 KB Output is correct
8 Correct 83 ms 548 KB Output is correct
9 Correct 68 ms 468 KB Output is correct
10 Correct 79 ms 552 KB Output is correct
11 Correct 78 ms 564 KB Output is correct
12 Correct 90 ms 548 KB Output is correct
13 Correct 94 ms 556 KB Output is correct
14 Correct 86 ms 560 KB Output is correct
15 Correct 89 ms 560 KB Output is correct
16 Correct 77 ms 544 KB Output is correct
17 Correct 80 ms 600 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1609 ms 7492 KB Output is correct
2 Correct 1582 ms 7164 KB Output is correct
3 Correct 1572 ms 7372 KB Output is correct
4 Correct 1670 ms 7204 KB Output is correct
5 Correct 1630 ms 7160 KB Output is correct
6 Correct 2478 ms 7356 KB Output is correct
7 Correct 2505 ms 7384 KB Output is correct
8 Correct 2471 ms 7444 KB Output is correct
9 Correct 188 ms 2500 KB Output is correct
10 Correct 1543 ms 7288 KB Output is correct
11 Correct 1491 ms 7316 KB Output is correct
12 Correct 1405 ms 7508 KB Output is correct
13 Correct 1157 ms 7152 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1522 ms 5640 KB Output is correct
2 Correct 1608 ms 3324 KB Output is correct
3 Correct 2236 ms 5780 KB Output is correct
4 Correct 1558 ms 5660 KB Output is correct
5 Correct 174 ms 2436 KB Output is correct
6 Correct 1995 ms 5832 KB Output is correct
7 Correct 1595 ms 5672 KB Output is correct
8 Correct 1334 ms 5616 KB Output is correct
9 Correct 1073 ms 5916 KB Output is correct
10 Correct 962 ms 5824 KB Output is correct
11 Correct 951 ms 5532 KB Output is correct
12 Correct 769 ms 5544 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1234 ms 12008 KB Output is correct
2 Correct 196 ms 2596 KB Output is correct
3 Correct 156 ms 9240 KB Output is correct
4 Correct 126 ms 9240 KB Output is correct
5 Correct 966 ms 11976 KB Output is correct
6 Correct 1223 ms 11848 KB Output is correct
7 Correct 920 ms 12076 KB Output is correct
8 Correct 634 ms 7236 KB Output is correct
9 Correct 616 ms 7324 KB Output is correct
10 Correct 702 ms 7588 KB Output is correct
11 Correct 983 ms 9700 KB Output is correct
12 Correct 1071 ms 9524 KB Output is correct
13 Correct 1074 ms 9732 KB Output is correct
14 Correct 816 ms 12008 KB Output is correct
15 Correct 912 ms 11892 KB Output is correct
16 Correct 1298 ms 11752 KB Output is correct
17 Correct 1171 ms 11888 KB Output is correct
18 Correct 1170 ms 11764 KB Output is correct
19 Correct 1162 ms 11784 KB Output is correct
20 Correct 936 ms 10644 KB Output is correct
21 Correct 998 ms 10496 KB Output is correct
22 Correct 1169 ms 11692 KB Output is correct
23 Correct 864 ms 10340 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1609 ms 7492 KB Output is correct
2 Correct 1582 ms 7164 KB Output is correct
3 Correct 1572 ms 7372 KB Output is correct
4 Correct 1670 ms 7204 KB Output is correct
5 Correct 1630 ms 7160 KB Output is correct
6 Correct 2478 ms 7356 KB Output is correct
7 Correct 2505 ms 7384 KB Output is correct
8 Correct 2471 ms 7444 KB Output is correct
9 Correct 188 ms 2500 KB Output is correct
10 Correct 1543 ms 7288 KB Output is correct
11 Correct 1491 ms 7316 KB Output is correct
12 Correct 1405 ms 7508 KB Output is correct
13 Correct 1157 ms 7152 KB Output is correct
14 Correct 1522 ms 5640 KB Output is correct
15 Correct 1608 ms 3324 KB Output is correct
16 Correct 2236 ms 5780 KB Output is correct
17 Correct 1558 ms 5660 KB Output is correct
18 Correct 174 ms 2436 KB Output is correct
19 Correct 1995 ms 5832 KB Output is correct
20 Correct 1595 ms 5672 KB Output is correct
21 Correct 1334 ms 5616 KB Output is correct
22 Correct 1073 ms 5916 KB Output is correct
23 Correct 962 ms 5824 KB Output is correct
24 Correct 951 ms 5532 KB Output is correct
25 Correct 769 ms 5544 KB Output is correct
26 Correct 1857 ms 7228 KB Output is correct
27 Correct 2246 ms 7344 KB Output is correct
28 Correct 1764 ms 7512 KB Output is correct
29 Correct 1181 ms 7120 KB Output is correct
30 Correct 1880 ms 7336 KB Output is correct
31 Correct 1884 ms 7460 KB Output is correct
32 Correct 1889 ms 7536 KB Output is correct
33 Correct 1578 ms 7308 KB Output is correct
34 Correct 1585 ms 7232 KB Output is correct
35 Correct 1597 ms 7460 KB Output is correct
36 Correct 1171 ms 7192 KB Output is correct
37 Correct 1207 ms 7352 KB Output is correct
38 Correct 1202 ms 7384 KB Output is correct
39 Correct 947 ms 7496 KB Output is correct
40 Correct 915 ms 7276 KB Output is correct
41 Correct 954 ms 7300 KB Output is correct
42 Correct 688 ms 7132 KB Output is correct
43 Correct 703 ms 7192 KB Output is correct
44 Correct 713 ms 7276 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 73 ms 724 KB Output is correct
4 Correct 17 ms 468 KB Output is correct
5 Correct 75 ms 556 KB Output is correct
6 Correct 59 ms 468 KB Output is correct
7 Correct 77 ms 536 KB Output is correct
8 Correct 83 ms 548 KB Output is correct
9 Correct 68 ms 468 KB Output is correct
10 Correct 79 ms 552 KB Output is correct
11 Correct 78 ms 564 KB Output is correct
12 Correct 90 ms 548 KB Output is correct
13 Correct 94 ms 556 KB Output is correct
14 Correct 86 ms 560 KB Output is correct
15 Correct 89 ms 560 KB Output is correct
16 Correct 77 ms 544 KB Output is correct
17 Correct 80 ms 600 KB Output is correct
18 Correct 1609 ms 7492 KB Output is correct
19 Correct 1582 ms 7164 KB Output is correct
20 Correct 1572 ms 7372 KB Output is correct
21 Correct 1670 ms 7204 KB Output is correct
22 Correct 1630 ms 7160 KB Output is correct
23 Correct 2478 ms 7356 KB Output is correct
24 Correct 2505 ms 7384 KB Output is correct
25 Correct 2471 ms 7444 KB Output is correct
26 Correct 188 ms 2500 KB Output is correct
27 Correct 1543 ms 7288 KB Output is correct
28 Correct 1491 ms 7316 KB Output is correct
29 Correct 1405 ms 7508 KB Output is correct
30 Correct 1157 ms 7152 KB Output is correct
31 Correct 1522 ms 5640 KB Output is correct
32 Correct 1608 ms 3324 KB Output is correct
33 Correct 2236 ms 5780 KB Output is correct
34 Correct 1558 ms 5660 KB Output is correct
35 Correct 174 ms 2436 KB Output is correct
36 Correct 1995 ms 5832 KB Output is correct
37 Correct 1595 ms 5672 KB Output is correct
38 Correct 1334 ms 5616 KB Output is correct
39 Correct 1073 ms 5916 KB Output is correct
40 Correct 962 ms 5824 KB Output is correct
41 Correct 951 ms 5532 KB Output is correct
42 Correct 769 ms 5544 KB Output is correct
43 Correct 1234 ms 12008 KB Output is correct
44 Correct 196 ms 2596 KB Output is correct
45 Correct 156 ms 9240 KB Output is correct
46 Correct 126 ms 9240 KB Output is correct
47 Correct 966 ms 11976 KB Output is correct
48 Correct 1223 ms 11848 KB Output is correct
49 Correct 920 ms 12076 KB Output is correct
50 Correct 634 ms 7236 KB Output is correct
51 Correct 616 ms 7324 KB Output is correct
52 Correct 702 ms 7588 KB Output is correct
53 Correct 983 ms 9700 KB Output is correct
54 Correct 1071 ms 9524 KB Output is correct
55 Correct 1074 ms 9732 KB Output is correct
56 Correct 816 ms 12008 KB Output is correct
57 Correct 912 ms 11892 KB Output is correct
58 Correct 1298 ms 11752 KB Output is correct
59 Correct 1171 ms 11888 KB Output is correct
60 Correct 1170 ms 11764 KB Output is correct
61 Correct 1162 ms 11784 KB Output is correct
62 Correct 936 ms 10644 KB Output is correct
63 Correct 998 ms 10496 KB Output is correct
64 Correct 1169 ms 11692 KB Output is correct
65 Correct 864 ms 10340 KB Output is correct
66 Correct 1857 ms 7228 KB Output is correct
67 Correct 2246 ms 7344 KB Output is correct
68 Correct 1764 ms 7512 KB Output is correct
69 Correct 1181 ms 7120 KB Output is correct
70 Correct 1880 ms 7336 KB Output is correct
71 Correct 1884 ms 7460 KB Output is correct
72 Correct 1889 ms 7536 KB Output is correct
73 Correct 1578 ms 7308 KB Output is correct
74 Correct 1585 ms 7232 KB Output is correct
75 Correct 1597 ms 7460 KB Output is correct
76 Correct 1171 ms 7192 KB Output is correct
77 Correct 1207 ms 7352 KB Output is correct
78 Correct 1202 ms 7384 KB Output is correct
79 Correct 947 ms 7496 KB Output is correct
80 Correct 915 ms 7276 KB Output is correct
81 Correct 954 ms 7300 KB Output is correct
82 Correct 688 ms 7132 KB Output is correct
83 Correct 703 ms 7192 KB Output is correct
84 Correct 713 ms 7276 KB Output is correct
85 Correct 2060 ms 15696 KB Output is correct
86 Correct 233 ms 11272 KB Output is correct
87 Correct 192 ms 11252 KB Output is correct
88 Correct 1777 ms 14044 KB Output is correct
89 Correct 2033 ms 15408 KB Output is correct
90 Correct 1796 ms 13888 KB Output is correct
91 Correct 1677 ms 9896 KB Output is correct
92 Correct 1699 ms 10216 KB Output is correct
93 Correct 2448 ms 10088 KB Output is correct
94 Correct 1819 ms 12776 KB Output is correct
95 Correct 1798 ms 12764 KB Output is correct
96 Correct 2129 ms 12576 KB Output is correct
97 Correct 1303 ms 14096 KB Output is correct
98 Correct 1079 ms 13940 KB Output is correct
99 Correct 2106 ms 15500 KB Output is correct
100 Correct 2091 ms 15260 KB Output is correct
101 Correct 2136 ms 15440 KB Output is correct
102 Correct 2092 ms 15612 KB Output is correct
103 Correct 2366 ms 13732 KB Output is correct
104 Correct 2321 ms 13680 KB Output is correct
105 Correct 1400 ms 13400 KB Output is correct
106 Correct 985 ms 12516 KB Output is correct
107 Correct 1456 ms 13788 KB Output is correct
108 Correct 2501 ms 14892 KB Output is correct
109 Correct 1914 ms 12008 KB Output is correct