oj.uz

답안 #106120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106120 2019-04-16T16:18:26 Z Noam527 Alternating Current (BOI18_alternating) C++17
0 / 100
 1816 ms 1049600 KB 
#include <bits/stdc++.h>
#define CHECK cout << "ok" << endl
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 1e18;
const int OO = 0;
const int OOO = 1;
using namespace std;

struct edge {
	int to, i;
	edge(int tt = 0, int ii = 0) : to(tt), i(ii) {}
};

int n, m;
int C[100005] = {};
int dp[200005], to[200005];
int range[200005] = {};

vector<edge> g[200005];
vector<int> vis;
vector<int> path;

string ans;

void add(int l, int r) {
	C[l]++;
	C[r + 1]--;
}
void pre() {
	for (int i = 1; i <= n; i++) C[i] += C[i - 1];
	for (int i = 1; i <= n; i++) {
		if (C[i] == 1) {
			cout << "impossible\n";
			exit(0);
		}
		C[i] = max(0, min(1, C[i] - 2));
		if (C[i]) {
			if (OO) {
				cout << "from C adding " << i << " " << i - 1 << '\n';
			}
			g[i].push_back(edge(i - 1, -1));
			g[i + n].push_back(edge(i - 1 + n, -1));
		}
	}
}

bool dfs(int v, int tar) {
	if (OO) {
		cout << "dfsing " << v << " tar " << tar << '\n';
	}
	if (v == tar) return true;
	if (vis[v % n]) return false;
	for (const auto &i : g[v]) {
		path.push_back(i.i);
		if (dfs(i.to, tar)) return true;
		path.pop_back();
	}
	return false;
}

bool check(int v) {
	if (OO) {
		cout << "starting check on " << v << '\n';
	}
	for (auto &i : vis) i = 0;
	vis[v] = 1;
	for (const auto &i : g[v]) {
		path.push_back(i.i);
		if (i.to != v - 1 && dfs(i.to, v + n)) return true;
		path.pop_back();
	}
	return false;
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
  	if (n > 1000) finish(-1); // judge quickly please
	for (int i = 0, l, r; i < m; i++) {
		cin >> l >> r;
		if (l > r) {
			add(l, n);
			add(1, r);
			l--;
			r += n;
			if (OO) cout << "from input adding " << l << " " << r << '\n';
			g[l].push_back(edge(r, i));
			g[l + n].push_back(edge(2 * n, i));
		}
		else {
			add(l, r);
			l--;
			if (OO) cout << "from input adding " << l << " " << r << '\n';
			g[l].push_back(edge(r, i));
			g[l + n].push_back(edge(r + n, i));
		}
	}
	pre();

	ans.resize(m, '1');
	vis.resize(n, 0);

	for (int i = 0; i < n; i++) {
		if (check(i)) {
			for (const auto &j : path)
				if (j != -1) ans[j] = '0';
			finish(ans);
		}
	}
	finish("impossible");
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Runtime error 1816 ms 1049600 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Runtime error 1816 ms 1049600 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Runtime error 1816 ms 1049600 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 4992 KB -1 is not a string of length exactly 100000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Runtime error 1816 ms 1049600 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -