제출 #361927

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
361927		Return_0	이상한 기계 (APIO19_strange_device)	C++17	15 / 100	2445 ms	524288 KiB

strange_device

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1);
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
// #define lc (v << 1)
// #define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (1e18), mod = 1e9 + 7, MOD = 998244353;

template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
	return out << '(' << a.first << ", " << a.second << ')';    }
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 2e7 + 7;

ll sum [N], lc [N], rc [N], lst = 1, n, A, B, md;
bool lz [N];

inline void push (cl &l, cl &r, cl &v) {	sum[v] = r - l + 1;	lz[v] = true;	}
inline void shift (cl &l, cl &r, cl &v) { if (lz[v]) { push(l, mid, lc[v]); push(mid + 1, r, rc[v]); } }

void upd (cl &ql, cl &qr, cl &l = 0, cl &r = md - 1, cl &v = 1) {
	if (r < ql || qr < l || lz[v])	return;
	if (ql <= l && r <= qr)	{
		push(l, r, v);
		return;
	}

	if (!lc[v])	lc[v] = ++lst, rc[v] = ++lst;

	shift(l, r, v);

	upd(ql, qr, l, mid, lc[v]);
	upd(ql, qr, mid + 1, r, rc[v]);

	sum[v] = sum[lc[v]] + sum[rc[v]];
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> A >> B;

	md = A / __gcd(A, B + 1);
	if ((inf + 10LL) / md < B)	md = inf + 10;
	else md = md * B;

	dbg(md);

	for (ll l, r; n--;) {
		cin>> l >> r; l %= md, r %= md;
		if (l <= r)	upd(l, r);
		else upd(0, r), upd(l, md - 1);
	}

	kill(sum[1]);

	return 0;
}
/*
3 3 3
4 4
7 9
17 18

3 5 10
1 20
50 68
89 98

2 16 13
2 5
18 18

*/

컴파일 시 표준 에러 (stderr) 메시지

strange_device.cpp: In function 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)':
strange_device.cpp:44:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |  ^~
strange_device.cpp:44:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |                                ^~~
strange_device.cpp: In function 'int main()':
strange_device.cpp:23:18: warning: statement has no effect [-Wunused-value]
   23 | #define dbg(...) 0
      |                  ^
strange_device.cpp:82:2: note: in expansion of macro 'dbg'
   82 |  dbg(md);
      |  ^~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 5
• Subtask 3: 5 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30