oj.uz

답안 #979356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979356 2024-05-10T17:03:12 Z c2zi6 동굴 (IOI13_cave) C++14
13 / 100
 500 ms 560 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "cave.h"

void exploreCave(int n) {
	int s[n];
	int d[n];
	rep(i, n) s[i] = 2;

	int tmp[n];
	for (int cur = 0; cur < n; cur++) {
		/* cout << "kstugenq te vor@ kbace " << cur << "-rd dur@" << endl; */

		int l = -1, r = n-1;
		while (l + 1 < r) {
			int m = (l + r) / 2;

			rep(i, n) tmp[i] = s[i];
			replr(i, 0, m) if (tmp[i] == 2) tmp[i] = 1;
			replr(i, m+1, n-1) if (tmp[i] == 2) tmp[i] = 0;

			if (tryCombination(tmp) == cur) r = m;
			else l = m;
		}

		/* cout << "parzvig@ " << r << "-@" << endl; */

		s[r] = 0;
		d[r] = cur;

		/* cout << "hmi shablon@: "; */
		/* rep(i, n) cout << s[i] << " "; cout << endl; */
	}

	rep(i, n) s[i] = 0;
	answer(s, d);
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 187 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 301 ms 560 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 338 ms 348 KB Output is correct
7 Correct 263 ms 560 KB Output is correct
8 Correct 500 ms 556 KB Output is correct
9 Correct 471 ms 560 KB Output is correct
10 Correct 477 ms 560 KB Output is correct
11 Correct 269 ms 556 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 187 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -