oj.uz

Submission #962534

# Submission time Handle Problem Language Result Execution time Memory
962534 2024-04-13T18:47:52 Z Amr Bridges (APIO19_bridges) C++17
0 / 100
 161 ms 12072 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define S second
#define F first
#define all(x) (x).begin(),(x).end()
#define sz size()
#define Yes cout << "YES" << endl
#define No cout << "NO" << endl
#define pb(x) push_back(x);
#define endl '\n'
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N=1e5+7;
ll INF=INT_MAX,mod=1e9+7;
int TT=1;
ll power(ll x, unsigned int y)
{
    ll res = 1;
    x = x; // % mod;
    if (x == 0) return 0;
    while (y > 0)
    {
        if (y & 1) res = (res*x)  ; // % mod;
        y = y>>1;
        x = (x*x) ; // % mod;
    }
    return res;
}

ll n , m;
vector<ll> e[N];
ll p[N];
ll siz[N];
ll ans[N];
pair<ll,ll> qu[N];
vector<pair<ll,ll> > vec;
ll get(ll x)
{
    if(x==p[x]) return x;
    return p[x] = get(p[x]);
}
void merg(ll x, ll y){
    x = get(x);
    y = get(y);
    if(x==y) return;
    p[x] = y;
    siz[y] +=siz[x];
}
void solve()
{
    ll n , m; cin >> n >> m;
    for(int i =1; i <= n; i++) p[i] = i, siz[i] = 1;
    for(int i = 0; i < m; i++)
    {
        e[i].resize(3);
        cin >> e[i][1] >> e[i][2] >> e[i][0];
    }
    sort(e,e+m); reverse(e,e+m);
    ll q; cin >> q;
    for(int i = 0; i < q; i++)
    {
        ll tp ; cin >> tp;
        cin >> qu[i].F >> qu[i].S;
        vec.push_back({qu[i].S,i});
    }
    sort(all(vec)); reverse(all(vec));
    ll l = 0;
    while(m!=0&&l<q&&e[0][0]<vec[l].F)
    {
        ans[vec[l].S] = 1;
        l++;
    }
    for(int i = 0; i < m; i++)
    {
        ll x = e[i][1] , y = e[i][2];
        merg(x,y);
        while(l<q&&(i==m-1||e[i+1][0]<vec[l].F))
        {
            //cout << i << endl;
            ans[vec[l].S] = siz[get(qu[vec[l].S].F)];
            l++;
        }
    }
    for(int i = 0; i < q; i++)
        cout << ans[i] << " "; cout << endl;
}
int main(){
    //freopen("friday.in","r",stdin);
    //freopen("frid
    while(TT--)
        solve();

    return 0;
}

Compilation message

bridges.cpp: In function 'void solve()':
bridges.cpp:85:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   85 |     for(int i = 0; i < q; i++)
      |     ^~~
bridges.cpp:86:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   86 |         cout << ans[i] << " "; cout << endl;
      |                                ^~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 116 ms 10408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 9676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 12072 KB Output is correct
2 Incorrect 69 ms 8712 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 116 ms 10408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6416 KB Output isn't correct
2 Halted 0 ms 0 KB -