oj.uz

답안 #286662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
286662 2020-08-30T16:49:32 Z ACmachine 이상한 기계 (APIO19_strange_device) C++17
100 / 100
 604 ms 59464 KB 
//this is actually 1
#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;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 

const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

ll gcd(ll a, ll b){
    return (a == 0 ? b : gcd(b%a, a));
}
struct AcAutomaton{
    vector<pll> segs;
    int n; ll a, b;
	void read_in(){
		cin >> n >> a >> b;
        REP(i, n){
            pll s; cin >> s;
            segs.pb(s);
        }
	}
    vector<pll> normalize(pll segment, bool moduling, ll mod){
        if(!moduling) return {segment};
        vector<pll> ans;
        ll cnt = segment.ff / mod;
        if(segment.ff / mod == segment.ss / mod) {
            return {mp(segment.ff%mod, segment.ss%mod)};
        }
        else if(segment.ff / mod + 1 == segment.ss / mod){
            return {mp(segment.ff % mod, mod-1), mp(0, segment.ss % mod)};
        }
        else return {mp(0, mod-1)};
    }
	void solve(){
		vector<pll> n_segs;
        ll mod;
        bool moduling = false;
        ll pp =  __gcd(a, b+1);
        if((ld)a / (ld)pp < (ld)2*INFF / (ld)b){
            moduling = true;
            mod = a / pp * b;
        }
        REP(i, segs.size()){
            vector<pll> tmp = normalize(segs[i], moduling, mod);
            for(auto x : tmp) n_segs.pb(x); 
        }
        pll seg = mp(-1ll, -1ll);
        sort(all(n_segs));
        ll ans = 0;
        for(auto x : n_segs){
            if(seg == mp(-1ll, -1ll)) seg = x;
            else{
                if(x.ff > seg.ss){
                    ans += (seg.ss - seg.ff + 1);
                    seg = x; 
                }
                else{
                    ckmax(seg.ss, x.ss);
                }
            }
        } 
        if(seg != mp(-1ll, -1ll)) ans += (seg.ss - seg.ff + 1);
        cout << ans << endl;
	}
};
    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int tcase = 1;
	while(tcase--){
		AcAutomaton solver;
		solver.read_in();
		solver.solve();
	}
    return 0;
}

Compilation message

strange_device.cpp: In member function 'std::vector<std::pair<long long int, long long int> > AcAutomaton::normalize(pll, bool, ll)':
strange_device.cpp:99:12: warning: unused variable 'cnt' [-Wunused-variable]
   99 |         ll cnt = segment.ff / mod;
      |            ^~~
strange_device.cpp: In member function 'void AcAutomaton::solve()':
strange_device.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
strange_device.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
strange_device.cpp:117:9: note: in expansion of macro 'REP'
  117 |         REP(i, segs.size()){
      |         ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 523 ms 40716 KB Output is correct
3 Correct 512 ms 40640 KB Output is correct
4 Correct 508 ms 59324 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 523 ms 40716 KB Output is correct
3 Correct 512 ms 40640 KB Output is correct
4 Correct 508 ms 59324 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 520 ms 59200 KB Output is correct
7 Correct 528 ms 59224 KB Output is correct
8 Correct 525 ms 59328 KB Output is correct
9 Correct 562 ms 59340 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 523 ms 40716 KB Output is correct
3 Correct 512 ms 40640 KB Output is correct
4 Correct 508 ms 59324 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 52 ms 8704 KB Output is correct
7 Correct 55 ms 8684 KB Output is correct
8 Correct 52 ms 8680 KB Output is correct
9 Correct 52 ms 8692 KB Output is correct
10 Correct 52 ms 8712 KB Output is correct
11 Correct 53 ms 8684 KB Output is correct
12 Correct 51 ms 8664 KB Output is correct
13 Correct 54 ms 8684 KB Output is correct
14 Correct 51 ms 8684 KB Output is correct
15 Correct 57 ms 8684 KB Output is correct
16 Correct 56 ms 8680 KB Output is correct
17 Correct 54 ms 8680 KB Output is correct
18 Correct 524 ms 59464 KB Output is correct
19 Correct 517 ms 59328 KB Output is correct
20 Correct 580 ms 59460 KB Output is correct
21 Correct 57 ms 8812 KB Output is correct
22 Correct 50 ms 8680 KB Output is correct
23 Correct 163 ms 30696 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 54 ms 4976 KB Output is correct
3 Correct 56 ms 4972 KB Output is correct
4 Correct 594 ms 40704 KB Output is correct
5 Correct 54 ms 5100 KB Output is correct
6 Correct 56 ms 5224 KB Output is correct
7 Correct 54 ms 5096 KB Output is correct
8 Correct 55 ms 5100 KB Output is correct
9 Correct 53 ms 5244 KB Output is correct
10 Correct 54 ms 5176 KB Output is correct
11 Correct 54 ms 5100 KB Output is correct
12 Correct 48 ms 5096 KB Output is correct
13 Correct 57 ms 5100 KB Output is correct
14 Correct 570 ms 40720 KB Output is correct
15 Correct 54 ms 5284 KB Output is correct
16 Correct 525 ms 59336 KB Output is correct
17 Correct 513 ms 59340 KB Output is correct
18 Correct 1 ms 384 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 5 ms 896 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 6 ms 1280 KB Output is correct
17 Correct 60 ms 8700 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 389 ms 40688 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 523 ms 40716 KB Output is correct
31 Correct 512 ms 40640 KB Output is correct
32 Correct 508 ms 59324 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 520 ms 59200 KB Output is correct
35 Correct 528 ms 59224 KB Output is correct
36 Correct 525 ms 59328 KB Output is correct
37 Correct 562 ms 59340 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 52 ms 8704 KB Output is correct
40 Correct 55 ms 8684 KB Output is correct
41 Correct 52 ms 8680 KB Output is correct
42 Correct 52 ms 8692 KB Output is correct
43 Correct 52 ms 8712 KB Output is correct
44 Correct 53 ms 8684 KB Output is correct
45 Correct 51 ms 8664 KB Output is correct
46 Correct 54 ms 8684 KB Output is correct
47 Correct 51 ms 8684 KB Output is correct
48 Correct 57 ms 8684 KB Output is correct
49 Correct 56 ms 8680 KB Output is correct
50 Correct 54 ms 8680 KB Output is correct
51 Correct 524 ms 59464 KB Output is correct
52 Correct 517 ms 59328 KB Output is correct
53 Correct 580 ms 59460 KB Output is correct
54 Correct 57 ms 8812 KB Output is correct
55 Correct 50 ms 8680 KB Output is correct
56 Correct 163 ms 30696 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 54 ms 4976 KB Output is correct
59 Correct 56 ms 4972 KB Output is correct
60 Correct 594 ms 40704 KB Output is correct
61 Correct 54 ms 5100 KB Output is correct
62 Correct 56 ms 5224 KB Output is correct
63 Correct 54 ms 5096 KB Output is correct
64 Correct 55 ms 5100 KB Output is correct
65 Correct 53 ms 5244 KB Output is correct
66 Correct 54 ms 5176 KB Output is correct
67 Correct 54 ms 5100 KB Output is correct
68 Correct 48 ms 5096 KB Output is correct
69 Correct 57 ms 5100 KB Output is correct
70 Correct 570 ms 40720 KB Output is correct
71 Correct 54 ms 5284 KB Output is correct
72 Correct 525 ms 59336 KB Output is correct
73 Correct 513 ms 59340 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 1 ms 384 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 1 ms 384 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 6 ms 1280 KB Output is correct
80 Correct 593 ms 59372 KB Output is correct
81 Correct 604 ms 59208 KB Output is correct
82 Correct 599 ms 59200 KB Output is correct
83 Correct 558 ms 59200 KB Output is correct
84 Correct 567 ms 59200 KB Output is correct
85 Correct 565 ms 59072 KB Output is correct
86 Correct 168 ms 30548 KB Output is correct
87 Correct 1 ms 392 KB Output is correct