oj.uz

답안 #332830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332830 2020-12-03T15:24:32 Z Dymo 다리 (APIO19_bridges) C++14
100 / 100
 2458 ms 133020 KB 
#include<bits/stdc++.h>
using namespace std;


#define pb    push_back
#define eb   emplace_back
#define ll int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define endl "\n"
const ll maxn=1e5+100;
const ll mod =1e9+7 ;
const ll base=1e18;
const ll block=1000;
/// con 1 ngay nua
/// zesitahn



struct dsu_rollback
{
    ll par[maxn];
    vector<pll> vt;
    dsu_rollback()
    {
        memset(par,-1,sizeof(par));
        vt.clear();
    }
    void rollback(ll t)
    {
        while (vt.size()>t)
        {
            auto p=vt.back();
            vt.pop_back();
            par[p.ff]=p.ss;
        }
    }
    ll find_par(ll u)
    {
        if (par[u]<0)
            return u;
        return find_par(par[u]);
    }
    void merge(ll x,ll y)
    {
        x=find_par(x);
        y=find_par(y);
        if (x==y) return ;
        if (par[x]>par[y])
        {
            swap(x,y);
        }
        vt.pb(make_pair(x,par[x]));
        vt.pb(make_pair(y,par[y]));
        par[x]+=par[y];
        par[y]=x;
    }
    bool chk(ll x,ll y)
    {
        return find_par(x)==find_par(y);
    }
};
ll w[maxn];
ll u[maxn];
ll v[maxn];
ll t[maxn];
ll a[maxn];
ll b[maxn];
ll wnw[maxn];
ll ans[maxn];
vector<ll> adj[maxn];
bool kt[maxn];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("queue.inp", "r"))
    {
        freopen("queue.inp", "r", stdin);
        freopen("queue.out", "w", stdout);
    }
    ll n, m;
     cin>> n>> m;
     for (int i=1;i<=m;i++)
     {
         cin>>u[i]>>v[i]>>w[i];
     }
     ll q;
      cin>> q;
      for (int i=1;i<=q;i++)
      {
          cin>>t[i]>>a[i]>>b[i];
      }
     for (int i=1;i<=q;i+=block)
     {
           ll l=i;
           ll r=min(i+block-1,q);
           dsu_rollback dsu;
           vector<pll> que;
           vector<ll> change;
           vector<pll> non;
           for (int j=l;j<=r;j++)
           {
               if (t[j]==1)
               {
                 kt[a[j]]=true;
                 change.pb(a[j]);
                 wnw[a[j]]=w[a[j]];
               }
           }

           for (int j=l;j<=r;j++)
           {
               if (t[j]==1)
               {
                 wnw[a[j]]=b[j];
               }
               else
               {
                  for (auto p:change)
                  {
                      if (b[j]<=wnw[p])
                      {
                         adj[j].pb(p);
                      }
                  }
                  que.pb(make_pair(b[j],j));
               }
           }
           for (int i=1;i<=m;i++)
           {
               if (!kt[i])
               {
                   non.pb(make_pair(w[i],i));
               }
           }
           sort(que.rbegin(),que.rend());
           sort(non.rbegin(),non.rend());
           ll idnw=0;
           for (auto p:que)
           {

               ll id=p.ss;
               while (idnw<non.size()&&non[idnw].ff>=p.ff)
               {
                   dsu.merge(u[non[idnw].ss],v[non[idnw].ss]);
                   idnw++;
               }
               ll siznw=dsu.vt.size();
               ll posnw=a[id];
               //cout <<p.ff<<" "<<p.ss<<" "<<posnw<<" "<<siznw<<" "<<non.size()<<endl;
               for (auto to:adj[id])
               {
                   dsu.merge(u[to],v[to]);
               }
              ans[id]=-dsu.par[dsu.find_par(posnw)];
               dsu.rollback(siznw);
           }
            for (int i=1;i<=m;i++)
           {
               if (kt[i])
               {
                   w[i]=wnw[i];
               }
               kt[i]=false;
           }
           for (int j=l;j<=r;j++)
           {
               adj[j].clear();
           }
     }
     for (int i=1;i<=q;i++)
     {
          if (t[i]==2)
          {
              cout <<ans[i]<<endl;
          }
     }


}

Compilation message

bridges.cpp:14:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   14 | const ll base=1e18;
      |               ^~~~
bridges.cpp: In member function 'void dsu_rollback::rollback(int)':
bridges.cpp:32:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |         while (vt.size()>t)
      |                ~~~~~~~~~^~
bridges.cpp: In function 'int main()':
bridges.cpp:147:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |                while (idnw<non.size()&&non[idnw].ff>=p.ff)
      |                       ~~~~^~~~~~~~~~~
bridges.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   82 |         freopen("queue.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   83 |         freopen("queue.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3052 KB Output is correct
2 Correct 2 ms 3052 KB Output is correct
3 Correct 39 ms 9964 KB Output is correct
4 Correct 6 ms 3308 KB Output is correct
5 Correct 40 ms 10732 KB Output is correct
6 Correct 31 ms 10988 KB Output is correct
7 Correct 38 ms 10988 KB Output is correct
8 Correct 43 ms 9324 KB Output is correct
9 Correct 53 ms 15340 KB Output is correct
10 Correct 48 ms 10220 KB Output is correct
11 Correct 46 ms 9964 KB Output is correct
12 Correct 54 ms 12524 KB Output is correct
13 Correct 50 ms 10604 KB Output is correct
14 Correct 47 ms 9708 KB Output is correct
15 Correct 52 ms 10604 KB Output is correct
16 Correct 46 ms 13420 KB Output is correct
17 Correct 48 ms 12524 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1503 ms 75188 KB Output is correct
2 Correct 1506 ms 74596 KB Output is correct
3 Correct 1531 ms 75020 KB Output is correct
4 Correct 1553 ms 74752 KB Output is correct
5 Correct 1556 ms 75268 KB Output is correct
6 Correct 2209 ms 133020 KB Output is correct
7 Correct 2191 ms 129796 KB Output is correct
8 Correct 2204 ms 129188 KB Output is correct
9 Correct 44 ms 4844 KB Output is correct
10 Correct 1516 ms 100800 KB Output is correct
11 Correct 1544 ms 100396 KB Output is correct
12 Correct 1339 ms 54660 KB Output is correct
13 Correct 1325 ms 48012 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1150 ms 73884 KB Output is correct
2 Correct 912 ms 98580 KB Output is correct
3 Correct 1393 ms 102124 KB Output is correct
4 Correct 1139 ms 73352 KB Output is correct
5 Correct 45 ms 4844 KB Output is correct
6 Correct 1300 ms 93404 KB Output is correct
7 Correct 1054 ms 65640 KB Output is correct
8 Correct 938 ms 49644 KB Output is correct
9 Correct 812 ms 41340 KB Output is correct
10 Correct 742 ms 29888 KB Output is correct
11 Correct 807 ms 39504 KB Output is correct
12 Correct 717 ms 29076 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1720 ms 8708 KB Output is correct
2 Correct 45 ms 6252 KB Output is correct
3 Correct 176 ms 8268 KB Output is correct
4 Correct 118 ms 8588 KB Output is correct
5 Correct 1751 ms 10900 KB Output is correct
6 Correct 1717 ms 12524 KB Output is correct
7 Correct 1716 ms 10996 KB Output is correct
8 Correct 919 ms 10424 KB Output is correct
9 Correct 878 ms 10632 KB Output is correct
10 Correct 885 ms 10244 KB Output is correct
11 Correct 1323 ms 11476 KB Output is correct
12 Correct 1317 ms 11780 KB Output is correct
13 Correct 1325 ms 11316 KB Output is correct
14 Correct 1481 ms 11180 KB Output is correct
15 Correct 1532 ms 11212 KB Output is correct
16 Correct 1716 ms 12508 KB Output is correct
17 Correct 1735 ms 12552 KB Output is correct
18 Correct 1722 ms 12420 KB Output is correct
19 Correct 1733 ms 12676 KB Output is correct
20 Correct 1504 ms 11680 KB Output is correct
21 Correct 1475 ms 11968 KB Output is correct
22 Correct 1666 ms 12316 KB Output is correct
23 Correct 1549 ms 10524 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1503 ms 75188 KB Output is correct
2 Correct 1506 ms 74596 KB Output is correct
3 Correct 1531 ms 75020 KB Output is correct
4 Correct 1553 ms 74752 KB Output is correct
5 Correct 1556 ms 75268 KB Output is correct
6 Correct 2209 ms 133020 KB Output is correct
7 Correct 2191 ms 129796 KB Output is correct
8 Correct 2204 ms 129188 KB Output is correct
9 Correct 44 ms 4844 KB Output is correct
10 Correct 1516 ms 100800 KB Output is correct
11 Correct 1544 ms 100396 KB Output is correct
12 Correct 1339 ms 54660 KB Output is correct
13 Correct 1325 ms 48012 KB Output is correct
14 Correct 1150 ms 73884 KB Output is correct
15 Correct 912 ms 98580 KB Output is correct
16 Correct 1393 ms 102124 KB Output is correct
17 Correct 1139 ms 73352 KB Output is correct
18 Correct 45 ms 4844 KB Output is correct
19 Correct 1300 ms 93404 KB Output is correct
20 Correct 1054 ms 65640 KB Output is correct
21 Correct 938 ms 49644 KB Output is correct
22 Correct 812 ms 41340 KB Output is correct
23 Correct 742 ms 29888 KB Output is correct
24 Correct 807 ms 39504 KB Output is correct
25 Correct 717 ms 29076 KB Output is correct
26 Correct 1487 ms 74912 KB Output is correct
27 Correct 1886 ms 104344 KB Output is correct
28 Correct 1582 ms 73156 KB Output is correct
29 Correct 1151 ms 30036 KB Output is correct
30 Correct 1762 ms 90416 KB Output is correct
31 Correct 1790 ms 92688 KB Output is correct
32 Correct 1803 ms 93616 KB Output is correct
33 Correct 1536 ms 73308 KB Output is correct
34 Correct 1547 ms 73464 KB Output is correct
35 Correct 1555 ms 74012 KB Output is correct
36 Correct 1200 ms 37292 KB Output is correct
37 Correct 1187 ms 36072 KB Output is correct
38 Correct 1185 ms 34444 KB Output is correct
39 Correct 1045 ms 20276 KB Output is correct
40 Correct 1008 ms 19556 KB Output is correct
41 Correct 1008 ms 18980 KB Output is correct
42 Correct 978 ms 18864 KB Output is correct
43 Correct 980 ms 18284 KB Output is correct
44 Correct 970 ms 17856 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3052 KB Output is correct
2 Correct 2 ms 3052 KB Output is correct
3 Correct 39 ms 9964 KB Output is correct
4 Correct 6 ms 3308 KB Output is correct
5 Correct 40 ms 10732 KB Output is correct
6 Correct 31 ms 10988 KB Output is correct
7 Correct 38 ms 10988 KB Output is correct
8 Correct 43 ms 9324 KB Output is correct
9 Correct 53 ms 15340 KB Output is correct
10 Correct 48 ms 10220 KB Output is correct
11 Correct 46 ms 9964 KB Output is correct
12 Correct 54 ms 12524 KB Output is correct
13 Correct 50 ms 10604 KB Output is correct
14 Correct 47 ms 9708 KB Output is correct
15 Correct 52 ms 10604 KB Output is correct
16 Correct 46 ms 13420 KB Output is correct
17 Correct 48 ms 12524 KB Output is correct
18 Correct 1503 ms 75188 KB Output is correct
19 Correct 1506 ms 74596 KB Output is correct
20 Correct 1531 ms 75020 KB Output is correct
21 Correct 1553 ms 74752 KB Output is correct
22 Correct 1556 ms 75268 KB Output is correct
23 Correct 2209 ms 133020 KB Output is correct
24 Correct 2191 ms 129796 KB Output is correct
25 Correct 2204 ms 129188 KB Output is correct
26 Correct 44 ms 4844 KB Output is correct
27 Correct 1516 ms 100800 KB Output is correct
28 Correct 1544 ms 100396 KB Output is correct
29 Correct 1339 ms 54660 KB Output is correct
30 Correct 1325 ms 48012 KB Output is correct
31 Correct 1150 ms 73884 KB Output is correct
32 Correct 912 ms 98580 KB Output is correct
33 Correct 1393 ms 102124 KB Output is correct
34 Correct 1139 ms 73352 KB Output is correct
35 Correct 45 ms 4844 KB Output is correct
36 Correct 1300 ms 93404 KB Output is correct
37 Correct 1054 ms 65640 KB Output is correct
38 Correct 938 ms 49644 KB Output is correct
39 Correct 812 ms 41340 KB Output is correct
40 Correct 742 ms 29888 KB Output is correct
41 Correct 807 ms 39504 KB Output is correct
42 Correct 717 ms 29076 KB Output is correct
43 Correct 1720 ms 8708 KB Output is correct
44 Correct 45 ms 6252 KB Output is correct
45 Correct 176 ms 8268 KB Output is correct
46 Correct 118 ms 8588 KB Output is correct
47 Correct 1751 ms 10900 KB Output is correct
48 Correct 1717 ms 12524 KB Output is correct
49 Correct 1716 ms 10996 KB Output is correct
50 Correct 919 ms 10424 KB Output is correct
51 Correct 878 ms 10632 KB Output is correct
52 Correct 885 ms 10244 KB Output is correct
53 Correct 1323 ms 11476 KB Output is correct
54 Correct 1317 ms 11780 KB Output is correct
55 Correct 1325 ms 11316 KB Output is correct
56 Correct 1481 ms 11180 KB Output is correct
57 Correct 1532 ms 11212 KB Output is correct
58 Correct 1716 ms 12508 KB Output is correct
59 Correct 1735 ms 12552 KB Output is correct
60 Correct 1722 ms 12420 KB Output is correct
61 Correct 1733 ms 12676 KB Output is correct
62 Correct 1504 ms 11680 KB Output is correct
63 Correct 1475 ms 11968 KB Output is correct
64 Correct 1666 ms 12316 KB Output is correct
65 Correct 1549 ms 10524 KB Output is correct
66 Correct 1487 ms 74912 KB Output is correct
67 Correct 1886 ms 104344 KB Output is correct
68 Correct 1582 ms 73156 KB Output is correct
69 Correct 1151 ms 30036 KB Output is correct
70 Correct 1762 ms 90416 KB Output is correct
71 Correct 1790 ms 92688 KB Output is correct
72 Correct 1803 ms 93616 KB Output is correct
73 Correct 1536 ms 73308 KB Output is correct
74 Correct 1547 ms 73464 KB Output is correct
75 Correct 1555 ms 74012 KB Output is correct
76 Correct 1200 ms 37292 KB Output is correct
77 Correct 1187 ms 36072 KB Output is correct
78 Correct 1185 ms 34444 KB Output is correct
79 Correct 1045 ms 20276 KB Output is correct
80 Correct 1008 ms 19556 KB Output is correct
81 Correct 1008 ms 18980 KB Output is correct
82 Correct 978 ms 18864 KB Output is correct
83 Correct 980 ms 18284 KB Output is correct
84 Correct 970 ms 17856 KB Output is correct
85 Correct 2224 ms 79956 KB Output is correct
86 Correct 211 ms 15344 KB Output is correct
87 Correct 163 ms 19836 KB Output is correct
88 Correct 2112 ms 92068 KB Output is correct
89 Correct 2227 ms 78952 KB Output is correct
90 Correct 2154 ms 100740 KB Output is correct
91 Correct 1608 ms 77616 KB Output is correct
92 Correct 1587 ms 77496 KB Output is correct
93 Correct 2176 ms 115328 KB Output is correct
94 Correct 1927 ms 78884 KB Output is correct
95 Correct 1890 ms 78872 KB Output is correct
96 Correct 2225 ms 119540 KB Output is correct
97 Correct 1836 ms 44264 KB Output is correct
98 Correct 1891 ms 41404 KB Output is correct
99 Correct 2319 ms 81216 KB Output is correct
100 Correct 2243 ms 79572 KB Output is correct
101 Correct 2335 ms 80120 KB Output is correct
102 Correct 2325 ms 80308 KB Output is correct
103 Correct 2456 ms 125228 KB Output is correct
104 Correct 2458 ms 124700 KB Output is correct
105 Correct 1876 ms 52352 KB Output is correct
106 Correct 1536 ms 32044 KB Output is correct
107 Correct 1787 ms 58612 KB Output is correct
108 Correct 2288 ms 115508 KB Output is correct
109 Correct 2237 ms 118836 KB Output is correct