제출 #800343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
800343		PixelCat	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	212 KiB

plants

#include "plants.h"
 
#ifdef NYAOWO
#include "grader.cpp"
#endif
 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 300;

vector<int> adj[MAXN + 10];
int vis[MAXN + 10];
bitset<MAXN + 10> tal[MAXN + 10];

int dist(int s, int t, int n) {
    if(s <= t) return t - s;
    else return t - s + n;
}

void dp(int n) {
    if(vis[n]) return;
    vis[n] = 1;
    tal[n].reset();
    for(auto &i:adj[n]) {
        dp(i);
        tal[n] |= tal[i];
        tal[n][i] = 1;
    }
}

void init(int k, vector<int> r) {
    int n = sz(r);
    vector<int> alive(n, 1);
    For(_, 1, n) {
        int idx = -1;
        vector<int> ids;
        For(i, 0, n - 1) if(alive[i]) {
            int c2 = k - 1;
            For(j, 1, k - 1) {
                if(alive[(i + j) % n]) {
                    c2--;
                }
            }
            if(c2 == r[i]) ids.eb(i);
        }
        For(i, 1, sz(ids)) {
            if(sz(ids) == 1 || dist(ids[i - 1], ids[i % sz(ids)], n) >= k) {
                idx = ids[i % sz(ids)];
                break;
            }
        }
        // for(auto &i:ids) cerr << i << " ";
        // cerr << "\n";
        assert(idx >= 0);
        // cerr << idx << "\n";
        // For(i, 0, n - 1) cerr << r[i] << " \n"[i == n - 1];
        For(i, n - k + 1, n - 1) {
            int id = (idx + i) % n;
            if(alive[id]) {
                adj[id].eb(idx);
            }
        }
        alive[idx] = 0;
    }
    memset(vis, 0, sizeof(vis));
    For(i, 0, n - 1) dp(i);
}

int compare_plants(int x, int y) {
    if(tal[y][x]) return 1;
    if(tal[x][y]) return -1;
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25