Submission #428269

#	Time	Username	Problem	Language	Result	Execution time	Memory
428269		Peti	Flood (IOI07_flood)	C++14	64 / 100	174 ms	12784 KiB

flood

#include <bits/stdc++.h>

using namespace std;

struct pont{
    int x, y;
    vector<pair<int, int>> t = {{-1, -1}, {-1, -1}, {-1, -1}, {-1, -1}};
    bool operator < (const pont &p) const{
        if(y != p.y)
            return y > p.y;
        return x < p.x;
    }
};

int index(int x, int f){
    x += f;
    if(x >= 4) x -= 4;
    if(x < 0) x += 4;
    return x;
}

vector<pont> g;
vector<int> elek;

void bejar(int os, int akt, int f, int s){
    //cout<<"bejar: "<<g[akt].x<<" "<<g[akt].y<<"\n";
    if(akt == s && os != -1){
        //cout<<"veg-------------------"<<endl;
        g[akt].t[index(f, 2)] = make_pair(-1, -1);
        return;
    }
    int irany = index(f, 1);
    for(int i = 0; i < 4; i++){
        if(g[akt].t[irany].first != -1){
            //cout<<"el: "<<irany<<" | "<<g[akt].t[irany].first<<" "<<g[akt].t[irany].second<<endl;
            int kov = g[akt].t[irany].first;
            elek[g[akt].t[irany].second]++;
            g[akt].t[irany] = make_pair(-1, -1);
            bejar(akt, kov, irany, s);
            if(os != -1)
                g[akt].t[index(f, 2)] = make_pair(-1, -1);
            return;
        }
        irany = index(irany, -1);
    }
    //cout<<"veg-------------------"<<endl;
    return;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;

    cin>>n;
    g.assign(n, pont());
    for(int i = 0; i < n; i++)
        cin>>g[i].x>>g[i].y;

    cin>>m;
    elek.assign(m, 0);
    for(int i = 0; i < m; i++){
        int a, b;
        cin>>a>>b;
        a--;
        b--;
        if(g[a].x == g[b].x){
            if(g[a].y > g[b].y) swap(a, b);
            g[a].t[0] = make_pair(b, i);
            g[b].t[2] = make_pair(a, i);
        } else{
            if(g[a].x > g[b].x) swap(a, b);
            g[a].t[1] = make_pair(b, i);
            g[b].t[3] = make_pair(a, i);
        }
    }

    vector<int> v(n);
    iota(v.begin(), v.end(), 0);
    sort(v.begin(), v.end(), [](int a, int b){ return g[a] < g[b]; });

    for(int x : v)
        bejar(-1, x, 3, x);

    //cout<<"finished"<<endl;

    vector<int> ki;
    for(int i = 0; i < m; i++)
        if(elek[i] == 2)
            ki.push_back(i+1);
    cout<<ki.size()<<"\n";
    for(int x : ki)
        cout<<x<<"\n";

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 3 / 3
• Subtask 5: 10 / 10
• Subtask 6: 3 / 3
• Subtask 7: 3 / 3
• Subtask 8: 3 / 3
• Subtask 9: 3 / 3
• Subtask 10: 0 / 9
• Subtask 11: 9 / 9
• Subtask 12: 0 / 9
• Subtask 13: 0 / 9
• Subtask 14: 0 / 9