oj.uz

답안 #171290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171290 2019-12-28T08:27:35 Z ruler Alternating Current (BOI18_alternating) C++14
0 / 100
 3000 ms 1400 KB 
// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

////////////////////////////////////////////////////////////////////

const int N = 1e5 + 5;

int n, m, L[N], R[N];
bool M[N][2];

string S(int mask) {
	string s = "";
	for (int i = 0; i < m; i++) s += '0' + ((mask >> i) & 1);
	return s;
}

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

	cin >> n >> m;
	for (int i = 0; i < m; i++) cin >> L[i] >> R[i], L[i]--, R[i]--;
	for (int mask = 0; mask < (1 << m); mask++) {
		for (int i = 0; i < n; i++) M[i][0] = M[i][1] = false;
		for (int i = 0; i < m; i++) {
			for (int j = L[i]; j != R[i]; j = (j + 1) % n) M[j][(mask >> i) & 1] = true;
			M[R[i]][(mask >> i) & 1] = true;
		}
		bool flag = true;
		for (int i = 0; i < n; i++) {
			flag &= M[i][0] & M[i][1];
			if (flag == false && mask == 20) debug(i, M[i][0], M[i][1]);
		}
		if (flag) die(S(mask));
	}
	cout << "impossible" << endl;

	return 0;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 3 ms 376 KB {i, is not a string of length exactly 9
5 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 3 ms 376 KB {i, is not a string of length exactly 9
5 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 3 ms 376 KB {i, is not a string of length exactly 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3032 ms 1400 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 3 ms 376 KB {i, is not a string of length exactly 9
5 Halted 0 ms 0 KB -