제출 #301285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301285		joseacaz	식물 비교 (IOI20_plants)	C++17	0 / 100	4021 ms	62584 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;
typedef long long ll;
typedef vector<int> vi;

const int MAXN = 2e5 + 5;
int N, k, vis[MAXN], memo[5005][5005];
vi r, Graph[MAXN];

void sub(int idx)
{
    for(int i = 1; i < k; i++)
    {
        int id = ((idx - i)%N + N)%N;
        if(r[id] > 0)
        {
            r[id]--;
            if(r[id] == 0 && !vis[id])
                Graph[idx].pb(id);
        }
    }
}

int getnext(int idx)
{
    for(int i = 1; i < N; i++)
    {
        int id = ((idx + i)%N + N)%N;
        if(i < k && !vis[id])
            Graph[idx].pb(id);
        if(r[id] == 0 && !vis[id])
            return id;
    }
    return idx;
}

void dfs(int root, int node)
{
    if(memo[root][node])
        return;
    memo[root][node] = 1;
    for(auto i : Graph[node])
        if(i != node)
            dfs(root, i);
}

void init(int _k, vi _r)
{
    k = _k;
    swap(r, _r);
    N = r.size();
    
    int maxIdx = 0;
    for(int i = 0; i < N; i++)
    {
        if(r[i] != 0)
            continue;
        int maxim = 1;
        for(int j = 1; j < k; j++)
        {
            int id = ((i - j)%N + N)%N;
            if(r[id] == 0)
                maxim = 0;
        }
        if(maxim)
            maxIdx = i;
    }
    
    while(!vis[maxIdx])
    {
        vis[maxIdx] = 1;
        sub(maxIdx);
        maxIdx = getnext(maxIdx);
    }
    for(int i = 0; i < N; i++)
        dfs(i, i);
	return;
}

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

컴파일 시 표준 에러 (stderr) 메시지

plants.cpp: In function 'void init(int, vi)':
plants.cpp:79:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   79 |     for(int i = 0; i < N; i++)
      |     ^~~
plants.cpp:81:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   81 |  return;
      |  ^~~~~~

• 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