제출 #318775

#제출 시각아이디문제언어결과실행 시간메모리
318775Foxyy동굴 (IOI13_cave)C++14
0 / 100
748 ms612 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 200000; const int INF = 0x3f3f3f3f, MOD = 1000000007; #define INIT(arr, val) fill(arr, arr+(int)(sizeof(arr)/sizeof(arr[0])), val) #define REP(i, lb, rb, inc) for(int i = (lb); i < (rb); i += inc) #define RREP(i, rb, lb, dec) for(int i = (rb)-1; i >= (lb); i -= dec) typedef long long ll; #define sz size() typedef stack<int, vector<int> > SI; typedef queue<int> QI; typedef vector<int> VI; #define pb push_back typedef pair<int, int> PII; #define mp make_pair #define F first #define S second #define endl '\n' #define dbg(a, b) cerr << "dbg: a " << b << endl; #define dbg_itv(a, b, c) cerr << "dbg_itv: " << a << " " << b << " : " << c << endl #define IOS() cin.tie(0); cout.sync_with_stdio(0) void exploreCave(int N) { int arr[N]; PII ans[N]; REP(i, 0, N, 1) { fill(arr, arr+N, 0); REP(j, 0, i, 1) arr[ans[j].F] = ans[j].S; int ret = tryCombination(arr); if (ret > i) ans[i].S = 0; else ans[i].S = 1; int lb, rb; lb = 0; rb = N; while(rb - lb - 1 > 0) { int mid = (lb+rb)/2; fill(arr+lb, arr+mid, ans[i].S); fill(arr+mid, arr+rb, 1-ans[i].S); REP(j, 0, i, 1) arr[ans[j].F] = ans[j].S; ret = tryCombination(arr); if (ret > i) rb = mid; else lb = mid; } ans[i].F = lb; } sort(ans, ans+N, [](PII A, PII B){ return A.F<B.F; }); int S[N], D[N]; REP(i, 0, N, 1) { D[i] = ans[i].F; S[i] = ans[i].S; } answer(S, D); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...