제출 #359467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
359467		beksultan04	식물 비교 (IOI20_plants)	C++14	0 / 100	44 ms	47340 KiB

plants

#include "plants.h"
#ifndef EVAL
#include "grader.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
int which[1000001],cost[1000001],whs,vis[1000001];
vector <int> f[1000001],g[1000001];
int find_f(int x){
    if (vis[x] != -1)ret vis[x];
    if (f[x].empty())ret vis[x] = x;
    ret vis[x] = find_f(f[x][0]);
}

void dfs(int x,int cnt=0){
    cost[x] = cnt;
    which[x] = whs;
    if (g[x].empty())ret ;
    dfs(g[x][0],cnt+1);
}

void init(int k, vector<int> r) {
    int n=r.size(),i;
    for (i=0;i<n;++i){
        which[i] = -1;
        vis[i]=-1;
        if (r[i] == 1){
            int y = (i+1)%n;
            g[i].pb(y);
            f[y].pb(i);
        }
    }
    for (i=0;i<n;++i){
        if (vis[i] == -1 && which[i] == -1){
            int x = find_f(i);
            whs++;
            dfs(x);
        }
    }
	ret;
}

int compare_plants(int x, int y) {
    if (which[x] != which[y])ret 0;
    if (cost[x] > cost[y])ret 1;
	ret -1;
}

• 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