oj.uz

답안 #434813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434813 2021-06-21T20:49:00 Z 2qbingxuan 낙하산 고리들 (IOI12_rings) C++14
0 / 100
 4 ms 4356 KB 
#include <bits/stdc++.h>
#ifdef local
#define debug(x...) qqbx(#x, x)
#define pary(x...) danb(#x, x)
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "(" << s << ") = ("), ..., (std::cerr << a << (--cnt ? ", " : ")\n")));
}
template <typename T> void danb(const char *t, T L, T R) {
    std::cerr << "[ " << t << " ] = [ ";
    for (int f = 0; L != R; ++L) std::cerr << (f++ ? ", " : "") << *L;
    std::cerr << " ]\n";
}
#else
#define debug(...) ((void)0)
#define pary(...) ((void)0)
#define safe ((void)0)
#endif // local

using namespace std;

// #include "lib1270.h"
const int maxn = 5005, K = 30;
struct Dsu {
    int pa[maxn], rk[maxn];
    int deg[maxn];
    bool ok;
    Dsu() {
        memset(pa, 0, sizeof pa);
        memset(rk, 0, sizeof rk);
        memset(deg, 0, sizeof deg);
    }
    void init(int n) {
        for (int i = 0; i < n; i++) pa[i] = i, rk[i] = 0, deg[i] = 0;
        ok = true;
    }
    int anc(int x) { return x==pa[x] ? x : pa[x]=anc(pa[x]); }
    bool join(int x, int y) {
        if (++deg[x] == 3) ok = false;
        if (++deg[y] == 3) ok = false;
        if ((x=anc(x)) == (y=anc(y))) return ok = false;
        if (rk[x] < rk[y]) swap(x, y);
        return pa[y] = x, rk[x]!=rk[y] || ++rk[x];
    }
} dsu[K];
vector<int> cand;
pair<int,int> E[maxn];
vector<int> adj[maxn];
bool inCand[maxn];
int tot, N;
void Init(int _N) {
    N = _N;
    for (int i = 0; i < K; i++)
        dsu[i].init(N);
    for (int i = 0; i < N; i++)
        adj[i].clear();
    for (int i = 0; i < N; i++)
        inCand[i] = false;
    cand.clear();
    tot = 0;
}
void addCand(int x) {
    if (inCand[x]) return;
    inCand[x] = true;
    if (cand.size() > K) return;
    int pos = cand.size();
    cand.push_back(x);
    if (cand.size() > K) return;
    for (int i = 0; i < tot; i++)
        if (x != E[i].first && x != E[i].second)
            dsu[pos].join(E[i].first, E[i].second);
}
void Link(int a, int b) {
    if (cand.size() > K) return;
    adj[a].push_back(b);
    adj[b].push_back(a);
    if (adj[a].size() == 3) {
        addCand(a);
        for (int j: adj[a])
            addCand(j);
    }
    if (adj[b].size() == 3) {
        addCand(b);
        for (int j: adj[b])
            addCand(j);
    }
    E[tot++] = { a, b };
    for (int i = 0; i < cand.size(); i++)
        if (a != cand[i] && b != cand[i])
            dsu[i].join(a, b);
}
int CountCritical() {
    if (cand.size() > K) return 0;
    if (cand.size() == 0) return N;
    int ans = 0;
    for (int i = 0; i < cand.size(); i++) if (dsu[i].ok) ++ans;
    return ans;
}
#ifdef local
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
}
#endif // local

Compilation message

rings.cpp: In function 'void Link(int, int)':
rings.cpp:89:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     for (int i = 0; i < cand.size(); i++)
      |                     ~~^~~~~~~~~~~~~
rings.cpp: In function 'int CountCritical()':
rings.cpp:97:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for (int i = 0; i < cand.size(); i++) if (dsu[i].ok) ++ans;
      |                     ~~^~~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 4 ms 2252 KB Output is correct
3 Correct 4 ms 2380 KB Output is correct
4 Incorrect 2 ms 2124 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 4356 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 4 ms 2252 KB Output is correct
3 Correct 4 ms 2380 KB Output is correct
4 Incorrect 2 ms 2124 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 4 ms 2252 KB Output is correct
3 Correct 4 ms 2380 KB Output is correct
4 Incorrect 2 ms 2124 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 4 ms 2252 KB Output is correct
3 Correct 4 ms 2380 KB Output is correct
4 Incorrect 2 ms 2124 KB Output isn't correct
5 Halted 0 ms 0 KB -