Submission #434052

#	Time	Username	Problem	Language	Result	Execution time	Memory
434052		aris12345678	Parachute rings (IOI12_rings)	C++14	0 / 100	4041 ms	42112 KiB

rings

#include <bits/stdc++.h>
using namespace std;

const int mxN = 1000005;
vector<int> adj[mxN];
int neib[mxN], n;

void Init(int size) {
    n = size;
}

void Link(int a, int b) {
    adj[a].push_back(b);
    adj[b].push_back(a);
    neib[a]++, neib[b]++;
}

int CountCritical() {
    int ans = 0;
    for(int i = 0; i < n; i++) {
        for(auto &v : adj[i])
            neib[v]--;
        bool ok = true;
        for(int j = 0; j < n; j++) {
            if(i == j) continue;
            if(neib[j] > 2) {
                ok = false;
                break;
            }
        }
        for(auto &v : adj[i])
            neib[v]++;
        if(ok)
            ans++;
    }
    return ans;
}

/*
int main() {
    scanf("%d", &n);
    Init(n);
    int q;
    scanf("%d", &q);
    while(q--) {
        int type, a, b;
        scanf("%d", &type);
        if(type == 1) {
            scanf("%d %d", &a, &b);
            Link(a, b);
        } else
            printf("%d\n", CountCritical());
    }
    return 0;
}
*/

• Subtask 1: 0 / 20
• Subtask 2: 0 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 14
• Subtask 5: 0 / 31