oj.uz

답안 #736120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736120 2023-05-05T08:43:29 Z marvinthang Alternating Current (BOI18_alternating) C++17
19 / 100
 38 ms 1976 KB 
/*************************************
*    author: marvinthang             *
*    created: 05.05.2023 10:12:26    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

struct Segment {
	int l, r, id;
	bool operator < (const Segment &other) const {
		return make_pair(l, r) < make_pair(other.l, other.r);
	}
};

// end of template

const int MAX = 1e5 + 5;

int N, M;
Segment seg[MAX];

void init(void) {
	cin >> N >> M;
	REP(i, M) {
		cin >> seg[i].l >> seg[i].r;
		seg[i].id = i;
	}
}

int res[MAX];

namespace SUBTASK_1 {

	int sum[2][23];

	void solve(void) {
		REP(mask, MASK(M)) {
			// REP(i, 2) memset(sum[i], 0, (N + 1) * sizeof(sum[i]));
			// REP(i, M) {
			// 	int t = BIT(mask, i);
			// 	++sum[t][seg[i].l];
			// 	--sum[t][seg[i].r + 1];
			// 	if (seg[i].l > seg[i].r) ++sum[t][1];
			// }
			// bool ok = true;
			// REP(t, 2) {
			// 	FORE(i, 1, N) {
			// 		sum[t][i] += sum[t][i - 1];
			// 		ok &= !!sum[t][i];
			// 	}
			// }
			// if (ok) {
			// 	REP(i, M) cout << BIT(mask, i);
			// 	return;
			// }
		}
		cout << "impossible";
	}

}

void process(void) {
	if (max(N, M) <= 20) {
		SUBTASK_1 :: solve();
		return;
	}
	sort(seg, seg + M);
	int cur[2] = {};
	REP(i, M) {
		int t = cur[0] > cur[1];
		if (seg[i].l > cur[t] + 1) return void(cout << "impossible\n");
		maximize(cur[t], seg[i].r);
		res[seg[i].id] = t;
	}
	if (min(cur[0], cur[1]) < N) return void(cout << "impossible\n");
	REP(i, M) cout << res[i];
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("B");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

alternating.cpp: In function 'int main()':
alternating.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
alternating.cpp:118:2: note: in expansion of macro 'file'
  118 |  file("B");
      |  ^~~~
alternating.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
alternating.cpp:118:2: note: in expansion of macro 'file'
  118 |  file("B");
      |  ^~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 'impossible' claimed, but there is a solution
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 'impossible' claimed, but there is a solution
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 'impossible' claimed, but there is a solution
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 1924 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 11 ms 1112 KB Output is correct
5 Correct 38 ms 1896 KB Output is correct
6 Correct 23 ms 1876 KB Output is correct
7 Correct 29 ms 1724 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 28 ms 1976 KB Output is correct
11 Correct 22 ms 1528 KB Output is correct
12 Correct 24 ms 1772 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 28 ms 1960 KB Output is correct
16 Correct 8 ms 1108 KB Output is correct
17 Correct 29 ms 1876 KB Output is correct
18 Correct 29 ms 1880 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 29 ms 1896 KB Output is correct

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 'impossible' claimed, but there is a solution
2 Halted 0 ms 0 KB -