oj.uz

답안 #385966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385966 2021-04-05T09:59:34 Z i_am_noob 식물 비교 (IOI20_plants) C++17
0 / 100
 2 ms 492 KB 
#include<bits/stdc++.h>
#include "plants.h"
using namespace std;

#define ll long long
//#define int ll
#define rep(n) rep1(i,n)
#define rep1(i,n) rep2(i,0,n)
#define rep2(i,a,b) for(int i=a; i<(b); ++i)
#define rep3(i,a,b) for(int i=a; i>=(b); --i)
#define pb push_back
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define inf 0x3f3f3f3f3f3f3f3f
#define pow2(x) (1ll<<(x))

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << " " << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T x){cerr << x << endl;}
template<typename T, typename ...S> void _do(T x, S... y){cerr << x << ", ";_do(y...);}
#else
#define bug(...) 49
#endif

const int maxn=200005;

int n,k,sum[maxn],a[maxn];
vector<int> r;



void init(int _k, vector<int> _r){
    k=_k;
    r=_r;
    n=sz(r);
    rep(n) sum[i+1]=sum[i]+r[i];
    set<int> st;
    rep(n) if(r[i]==0) st.insert(i);
    int maxx,maxid;
    vector<int> vec;
    if(n<5005){
    	bool flag;
	    rep3(i,n-1,0){
	    	flag=0;
	    	maxx=(*st.begin())-(*st.rbegin())+n;
	    	maxid=*st.begin();
	    	vec.clear();
	    	for(auto j: st) vec.pb(j);
	    	rep2(j,1,n) if(vec[j]-vec[j-1]>maxx) maxx=vec[j]-vec[j-1],maxid=vec[j];
	    	
    		a[maxid]=i;
    		rep1(ii,k-1){
    			r[(maxid-ii-1+n)%n]--;
    			if(r[(maxid-ii-1+n)%n]==0) st.insert((maxid-ii-1+n)%n);
    		}
    		r[maxid]=n;
	    	st.erase(maxid);
	    }
	}
}

int compare_plants(int x, int y) {
    if(k==2){
        if(sum[y]-sum[x]==y-x) return -1;
        if(sum[y]-sum[x]==0) return 1;
        if(sum[n]-sum[y]+sum[x]==n-y+x) return 1;
        if(sum[n]-sum[y]+sum[x]==0) return -1;
        return 0;
    }
    return a[x]>a[y]?1:-1;
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:43:11: warning: variable 'flag' set but not used [-Wunused-but-set-variable]
   43 |      bool flag;
      |           ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 1 ms 492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 2 ms 492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 2 ms 492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 2 ms 492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 2 ms 492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 1 ms 492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 1 ms 492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -