답안 #932227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932227 2024-02-23T05:53:02 Z Baizho 이상한 기계 (APIO19_strange_device) C++17
10 / 100
427 ms 18744 KB
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e3)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
#define int ll

bool comp(pair<int, int> a, pair<int, int> b) {
	if(a.ss == b.ss) return a.ff > b.ff;
	return a.ss < b.ss;
}

void Baizho() {
	int n, a, b; cin>>n>>a>>b;
	int siz = a / __gcd(a, b + 1);
	if(siz <= 1LL * 2e18 / b)	siz *= b;
	else siz = 2e18;
	vector<pair<int, int> > range;
	while(n --) {
		int l, r; cin>>l>>r;
		l %= siz; r %= siz;
		if(l <= r) {
			range.pb({l, r});
		} else {
			range.pb({0, r});
			range.pb({l, siz - 1});
		}
	}
	sort(all(range), comp);
	int maxr = -1, ans = 0;
	for(auto c : range) {
		if(maxr < c.ff) {
			// new segment started
			ans += c.ss - c.ff + 1;
			maxr = c.ss;
		} else if(c.ff <= maxr && maxr <= c.ss) {
			// not completely new
			ans += c.ss - maxr;
			maxr = c.ss;
		}
	}
	cout<<ans<<"\n";
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

strange_device.cpp: In function 'void Freopen(std::string)':
strange_device.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 5 ms 736 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 357 ms 18616 KB Output is correct
3 Correct 349 ms 17592 KB Output is correct
4 Correct 337 ms 17192 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 357 ms 18616 KB Output is correct
3 Correct 349 ms 17592 KB Output is correct
4 Correct 337 ms 17192 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 373 ms 18160 KB Output is correct
7 Correct 358 ms 17672 KB Output is correct
8 Correct 370 ms 18464 KB Output is correct
9 Correct 417 ms 17512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 357 ms 18616 KB Output is correct
3 Correct 349 ms 17592 KB Output is correct
4 Correct 337 ms 17192 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 33 ms 2516 KB Output is correct
7 Correct 38 ms 2516 KB Output is correct
8 Correct 45 ms 2632 KB Output is correct
9 Correct 37 ms 2520 KB Output is correct
10 Correct 35 ms 2528 KB Output is correct
11 Correct 37 ms 2572 KB Output is correct
12 Correct 32 ms 2660 KB Output is correct
13 Correct 37 ms 2528 KB Output is correct
14 Correct 34 ms 2520 KB Output is correct
15 Incorrect 39 ms 2572 KB Output isn't correct
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 37 ms 2588 KB Output is correct
3 Correct 36 ms 2516 KB Output is correct
4 Correct 427 ms 18360 KB Output is correct
5 Correct 37 ms 2516 KB Output is correct
6 Correct 40 ms 2656 KB Output is correct
7 Correct 54 ms 2620 KB Output is correct
8 Correct 38 ms 2520 KB Output is correct
9 Correct 51 ms 2508 KB Output is correct
10 Correct 36 ms 2520 KB Output is correct
11 Correct 41 ms 2516 KB Output is correct
12 Correct 35 ms 2520 KB Output is correct
13 Correct 37 ms 2516 KB Output is correct
14 Incorrect 399 ms 18744 KB Output isn't correct
15 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 5 ms 736 KB Output isn't correct
3 Halted 0 ms 0 KB -