oj.uz

Submission #1020348

# Submission time Handle Problem Language Result Execution time Memory
1020348 2024-07-12T00:49:43 Z vjudge1 Flood (IOI07_flood) C++17
73 / 100
 283 ms 43328 KB 
#include<bits/stdc++.h>
using namespace std;
int X[100100],Y[100100],vis[400100],lev[400100],side[100100][4][2],Xof[400100];
vector<pair<int,int>> adj[400100];
void AE(int a,int b,int c){
    adj[a].push_back({b,c});
    adj[b].push_back({a,c});
}
set<pair<int,int>>st;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,w;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>X[i]>>Y[i];
    cin>>w;
    for(int i=1;i<=w;i++){
        int a,b;
        cin>>a>>b;
        if(X[a]==X[b]){
            if(Y[a]>Y[b])swap(a,b);
            side[a][2][1]=i;
            side[a][2][0]=i+w;
            side[b][0][0]=i;
            side[b][0][1]=i+w;
            Xof[i]=X[a];
        } else {
            if(X[a]>X[b])swap(a,b);
            side[a][1][0]=i;
            side[a][1][1]=i+w;
            side[b][3][1]=i;
            side[b][3][0]=i+w;
            Xof[i]=1e9;
        }
        st.insert({Xof[i],i});
        AE(i,i+w,1);
    }
    for(int i=1;i<=n;i++)
        for(int j=0;j<4;j++) if(side[i][j][1])
            for(int k=(j+1)%4;;k=(k+1)%4) if(side[i][k][0]){
                AE(side[i][k][0],side[i][j][1],0);break;}
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>Q;
    memset(lev,7,sizeof lev);
    while(1){
        if(st.empty())break;
        int K=st.begin()->second;
        Q.push({0,K});
        lev[K]=0;
        while(Q.size()){
            auto[y,x]=Q.top(); Q.pop();
            if(vis[x])continue;
            if(x<=w)st.erase({Xof[x],x});
            vis[x]=1;
            for(auto[i,j]:adj[x])
                if(lev[i]>y+j)
                    Q.push({lev[i]=y+j,i});
        }
    }
    vector<int>v;
    for(int i=1;i<=w;i++)
        if(lev[i]==lev[i+w])
            v.push_back(i);
    cout<<v.size()<<'\n';
    for(auto i:v)
        cout<<i<<'\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11356 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 4 ms 11216 KB Output is correct
3 Correct 4 ms 11356 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 5 ms 11356 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 4 ms 11268 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct

Subtask #7
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11356 KB Output is correct

Subtask #8
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11352 KB Output is correct
2 Correct 5 ms 11612 KB Output is correct

Subtask #9
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11352 KB Output is correct
2 Correct 5 ms 11356 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 16212 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 28856 KB Output is correct

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 30036 KB Output is correct
2 Runtime error 273 ms 43328 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #13
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 218 ms 36560 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 283 ms 40140 KB Memory limit exceeded
2 Halted 0 ms 0 KB -