// __________________
// | ________________ |
// || ____ ||
// || /\ | ||
// || /__\ | ||
// || / \ |____ ||
// ||________________||
// |__________________|
// \###################\
// \###################\
// \ ____ \
// \_______\___\_______\
// An AC a day keeps the doctor away.
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> constexpr void qqbx(const char *s, const H &h, T &&...args) {
for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
if constexpr(sizeof...(T)) qqbx(++s, args...); // C++ 17!
}
#else
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define get_pos(v,x) int(lower_bound(begin(v),end(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define pb emplace_back
#define ff first
#define ss second
#define mem(v,x) memset(v,x,sizeof v)
using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
template <typename T> using max_heap = std::priority_queue<T,vector<T>,less<T> >;
template <typename T> using min_heap = std::priority_queue<T,vector<T>,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
constexpr ld PI = acos(-1), eps = 1e-9;
constexpr ll N = 1000325, INF = 2e18, MOD = 1000000007, K = 105, inf = 1e9;
constexpr inline ll cdiv(ll x, ll m) { return x/m + ((x<0 ^ m>0) && (x%m)); } // ceiling divide
constexpr inline ll modpow(ll e,ll p,ll m=MOD) { ll r=1; for(e%=m;p;p>>=1,e=e*e%m) if(p&1) r=r*e%m; return r; }
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
ll A, B;
cin >> n >> A >> B;
ll k = A / __gcd(A, B+1);
if(k <= INF / B) k *= B;
else k = INF;
/* debug(k); */
/* for(int i = 0; i < k; i++) { */
/* ll x = (i + i/B) % A; */
/* ll y = i%B; */
/* cout << x << ' ' << y << '\n'; */
/* } */
/* return 0; */
vector<pair<ll,int>> evt;
for(int i = 0; i < n; i++) {
ll l, r;
cin >> l >> r;
++r;
l %= k;
r %= k;
if(l < r)
evt.pb(l, 1), evt.pb(r, -1);
else if(l > r)
evt.pb(0, 1), evt.pb(r, -1), evt.pb(l, 1), evt.pb(k, -1);
}
evt.pb(k, 0);
sort(all(evt));
ll ans = 0;
for(int i = 0, j, c = 0; i < evt.size(); i = j) {
for(j = i; j < evt.size(); j++) {
if(evt[j].first != evt[i].first) break;
c += evt[j].second;
}
if(c && j != evt.size()) ans += evt[j].first - evt[i].first;
}
cout << ans << '\n';
}
Compilation message
strange_device.cpp:9:1: warning: multi-line comment [-Wcomment]
// \###################\
^
strange_device.cpp:16:0: warning: ignoring #pragma loop_opt [-Wunknown-pragmas]
#pragma loop_opt(on)
strange_device.cpp: In function 'constexpr ll cdiv(ll, ll)':
strange_device.cpp:50:56: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
constexpr inline ll cdiv(ll x, ll m) { return x/m + ((x<0 ^ m>0) && (x%m)); } // ceiling divide
~^~
strange_device.cpp: In function 'int main()':
strange_device.cpp:83:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0, j, c = 0; i < evt.size(); i = j) {
~~^~~~~~~~~~~~
strange_device.cpp:84:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j = i; j < evt.size(); j++) {
~~^~~~~~~~~~~~
strange_device.cpp:88:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(c && j != evt.size()) ans += evt[j].first - evt[i].first;
~~^~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
