oj.uz

Submission #968452

# Submission time Handle Problem Language Result Execution time Memory
968452 2024-04-23T12:40:04 Z hirayuu_oj Flood (IOI07_flood) C++17
0 / 100
 47 ms 5560 KB 
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(x) x.begin(),x.end()
using ll=long long;

int dir(pair<int,int> x,pair<int,int> y){
    if(x.first==y.first){
        if(x.second<y.second)return 0;
        return 2;
    }
    if(x.first<y.first)return 1;
    return 3;
}
int wall_ind(array<pair<int,int>,4> wall){
    int cnt=0;
    int pos=-1;
    rep(i,4){
        if(wall[i].first!=-1){
            cnt++;
            pos=i;
        }
    }
    if(cnt==1)return pos;
    return -1;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin>>N;
    vector<pair<int,int>> pnt(N);
    rep(i,N){
        cin>>pnt[i].first>>pnt[i].second;
    }
    vector<array<pair<int,int>,4>> gr(N,{pair(-1,-1),pair(-1,-1),pair(-1,-1),pair(-1,-1)});
    int W;
    cin>>W;
    vector<pair<int,int>> wall(W);
    rep(i,W){
        cin>>wall[i].first>>wall[i].second;
        wall[i].first--;
        wall[i].second--;
        gr[wall[i].first][dir(pnt[wall[i].first],pnt[wall[i].second])]=pair(i,wall[i].second);
        gr[wall[i].second][dir(pnt[wall[i].second],pnt[wall[i].first])]=pair(i,wall[i].first);
    }
    vector<int> ans;
    stack<int> del;
    rep(i,N){
        if(wall_ind(gr[i])!=-1){
            del.push(i);
        }
    }
    while(!del.empty()){
        int pos=del.top();
        del.pop();
        if(wall_ind(gr[pos])==-1)continue;
        int dir=wall_ind(gr[pos]);
        ans.push_back(gr[pos][dir].first);
        gr[gr[pos][dir].second][(dir+2)%4]={-1,-1};
        if(wall_ind(gr[gr[pos][dir].second])!=-1){
            del.push(gr[pos][dir].second);
        }
        gr[pos][dir]={-1,-1};
    }
    cout<<ans.size()<<"\n";
    for(int i:ans)cout<<i+1<<"\n";
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 3.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 3.0

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

Subtask #7
0 / 3.0

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

Subtask #8
0 / 3.0

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

Subtask #9
0 / 3.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 9.0

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

Subtask #12
0 / 9.0

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

Subtask #13
0 / 9.0

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

Subtask #14
0 / 9.0

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