oj.uz

답안 #233858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233858 2020-05-22T03:12:01 Z rqi 이상한 기계 (APIO19_strange_device) C++14
100 / 100
 1325 ms 96504 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
    bool fst = 1; str res = "{";
    F0R(i,sz(v)) {
        if (!fst) res += ", ";
        fst = 0; res += ts(v[i]);
    }
    res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class T> str ts(T v) {
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

const int mx = 1000005;
const ll MAXVAL = 1000000000000000005LL;

int n;
ll A, B;

ll l[mx];
ll r[mx];

int main() {
    setIO();
    cin >> n >> A >> B;
    for(int i = 1; i <= n; i++){
        cin >> l[i] >> r[i];
    }

    ll g = A/(__gcd(B+1, A));

    map<ll, int> m;
    //dbg(B*g);
    for(int i = 1; i <= n; i++){
    	//B*g > MAXVAL
        if(B > MAXVAL/g){ //mod is big
        	m[l[i]]+=1;
        	m[r[i]+1]-=1;
        	m[MAXVAL];
            continue;
        } 
        ll M = B*g; // mod value
        m[M];
        ll len = r[i]-l[i]+1;
        if(len >= M){
        	ps(M);
        	return 0;
        }
        ll L = l[i] % M;
        ll R = r[i] % M;
        if(l[i]/M == r[i]/M){
        	m[L]+=1;
        	m[R+1]-=1;
        }
        else{
        	m[0]+=1;
        	m[R+1]-=1;
        	m[L]+=1;
        }
    }
    m[0];
    //dbg(m);
    int deriv = 0;
    
    for(auto &u: m){
    	int val = u.s;
    	u.s+=deriv;
    	deriv+=val;
    }

    ll ans = 0;
    ll lastind = -1;
    int lastval = 0;
    for(auto u: m){
    	ll curind = u.f;
    	int curval;
    	if(u.s > 0) curval = 1;
    	else curval = 0;

    	if(lastval == 1){
    		ans+=curind-lastind;
    	}
    	lastval = curval;
    	lastind = curind;
    }
    ps(ans);
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

strange_device.cpp: In function 'void setIn(std::__cxx11::string)':
strange_device.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
strange_device.cpp: In function 'void setOut(std::__cxx11::string)':
strange_device.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 12 ms 1536 KB Output is correct
3 Correct 12 ms 1536 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 12 ms 1536 KB Output is correct
17 Correct 89 ms 11896 KB Output is correct
18 Correct 5 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 364 ms 19064 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 929 ms 87912 KB Output is correct
3 Correct 957 ms 90360 KB Output is correct
4 Correct 992 ms 94200 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 929 ms 87912 KB Output is correct
3 Correct 957 ms 90360 KB Output is correct
4 Correct 992 ms 94200 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 945 ms 94300 KB Output is correct
7 Correct 954 ms 94200 KB Output is correct
8 Correct 932 ms 94200 KB Output is correct
9 Correct 1025 ms 94384 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 929 ms 87912 KB Output is correct
3 Correct 957 ms 90360 KB Output is correct
4 Correct 992 ms 94200 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 82 ms 11896 KB Output is correct
7 Correct 84 ms 11900 KB Output is correct
8 Correct 90 ms 11896 KB Output is correct
9 Correct 93 ms 11896 KB Output is correct
10 Correct 80 ms 11896 KB Output is correct
11 Correct 80 ms 11868 KB Output is correct
12 Correct 87 ms 11896 KB Output is correct
13 Correct 94 ms 11896 KB Output is correct
14 Correct 81 ms 11948 KB Output is correct
15 Correct 97 ms 11896 KB Output is correct
16 Correct 98 ms 11896 KB Output is correct
17 Correct 93 ms 11896 KB Output is correct
18 Correct 931 ms 94260 KB Output is correct
19 Correct 978 ms 93944 KB Output is correct
20 Correct 1032 ms 94204 KB Output is correct
21 Correct 88 ms 11896 KB Output is correct
22 Correct 88 ms 11896 KB Output is correct
23 Correct 162 ms 18304 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 94 ms 11896 KB Output is correct
3 Correct 93 ms 12024 KB Output is correct
4 Correct 976 ms 82300 KB Output is correct
5 Correct 100 ms 11896 KB Output is correct
6 Correct 101 ms 12024 KB Output is correct
7 Correct 99 ms 11896 KB Output is correct
8 Correct 96 ms 11896 KB Output is correct
9 Correct 98 ms 11896 KB Output is correct
10 Correct 87 ms 11860 KB Output is correct
11 Correct 98 ms 12028 KB Output is correct
12 Correct 94 ms 11896 KB Output is correct
13 Correct 98 ms 11900 KB Output is correct
14 Correct 1043 ms 82320 KB Output is correct
15 Correct 79 ms 11896 KB Output is correct
16 Correct 878 ms 88312 KB Output is correct
17 Correct 899 ms 96504 KB Output is correct
18 Correct 5 ms 384 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 12 ms 1536 KB Output is correct
3 Correct 12 ms 1536 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 12 ms 1536 KB Output is correct
17 Correct 89 ms 11896 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 364 ms 19064 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 929 ms 87912 KB Output is correct
31 Correct 957 ms 90360 KB Output is correct
32 Correct 992 ms 94200 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 945 ms 94300 KB Output is correct
35 Correct 954 ms 94200 KB Output is correct
36 Correct 932 ms 94200 KB Output is correct
37 Correct 1025 ms 94384 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 82 ms 11896 KB Output is correct
40 Correct 84 ms 11900 KB Output is correct
41 Correct 90 ms 11896 KB Output is correct
42 Correct 93 ms 11896 KB Output is correct
43 Correct 80 ms 11896 KB Output is correct
44 Correct 80 ms 11868 KB Output is correct
45 Correct 87 ms 11896 KB Output is correct
46 Correct 94 ms 11896 KB Output is correct
47 Correct 81 ms 11948 KB Output is correct
48 Correct 97 ms 11896 KB Output is correct
49 Correct 98 ms 11896 KB Output is correct
50 Correct 93 ms 11896 KB Output is correct
51 Correct 931 ms 94260 KB Output is correct
52 Correct 978 ms 93944 KB Output is correct
53 Correct 1032 ms 94204 KB Output is correct
54 Correct 88 ms 11896 KB Output is correct
55 Correct 88 ms 11896 KB Output is correct
56 Correct 162 ms 18304 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 94 ms 11896 KB Output is correct
59 Correct 93 ms 12024 KB Output is correct
60 Correct 976 ms 82300 KB Output is correct
61 Correct 100 ms 11896 KB Output is correct
62 Correct 101 ms 12024 KB Output is correct
63 Correct 99 ms 11896 KB Output is correct
64 Correct 96 ms 11896 KB Output is correct
65 Correct 98 ms 11896 KB Output is correct
66 Correct 87 ms 11860 KB Output is correct
67 Correct 98 ms 12028 KB Output is correct
68 Correct 94 ms 11896 KB Output is correct
69 Correct 98 ms 11900 KB Output is correct
70 Correct 1043 ms 82320 KB Output is correct
71 Correct 79 ms 11896 KB Output is correct
72 Correct 878 ms 88312 KB Output is correct
73 Correct 899 ms 96504 KB Output is correct
74 Correct 5 ms 384 KB Output is correct
75 Correct 4 ms 384 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 4 ms 384 KB Output is correct
78 Correct 4 ms 384 KB Output is correct
79 Correct 12 ms 1536 KB Output is correct
80 Correct 1014 ms 81532 KB Output is correct
81 Correct 1006 ms 90360 KB Output is correct
82 Correct 1157 ms 90240 KB Output is correct
83 Correct 1202 ms 90232 KB Output is correct
84 Correct 1325 ms 90128 KB Output is correct
85 Correct 1050 ms 90416 KB Output is correct
86 Correct 155 ms 18168 KB Output is correct
87 Correct 5 ms 384 KB Output is correct