oj.uz

답안 #887187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887187 2023-12-14T02:27:38 Z Kutan 이상한 기계 (APIO19_strange_device) C++14
15 / 100
 299 ms 71616 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;
const int N = 1e6 + 5;

int n;
ll A, B, l[N], r[N];

void readip(){
    cin >> n >> A >> B;
    REP(i, 1, n) cin >> l[i] >> r[i];
}

namespace sub1{
    bool check() {
        ll s = 0;
        REP(i, 1, n) s += r[i] - l[i] + 1;
        return s <= 1e6;
    }

    void solve() {
        vector<pair<ll, ll>> distinct;
        REP(i, 1, n) {
            for (ll x = l[i]; x <= r[i]; ++x) 
                distinct.eb((x + x / B) % A , x % B);
        }
        sort(ALL(distinct));
        distinct.erase(unique(ALL(distinct)), distinct.end());
        cout << distinct.size() << ln;
    }
};

namespace sub2{
    void solve() {
        vector<pair<ll,ll>> segment;
        ll cyc = (A & 1) ? A : A / 2;
        REP(i, 1, n) {
            if (l[i] / cyc < r[i] / cyc)
                segment.eb(l[i] % cyc, cyc - 1), segment.eb(0, r[i] % cyc);
            else
                segment.eb(l[i] % cyc, r[i] % cyc);
        }
        ll Right = -1, Left = 0, res = 0;
        sort(ALL(segment));
        for (auto [l, r] : segment) {
            if (l > Right) {
                res += Right - Left + 1;
                Left = l, Right = r;
                continue;
            }
            maximize(Right, r);
        }
        res += Right - Left + 1;
        cout << res << ln;
    }
};
void solve(){       
    if (sub1::check()) {
        sub1::solve();
        return;
    }    

    if (B == 1) {
        sub2::solve();
        return;
    }

    // int m = 8;
    // for (int i = 35; i <= 10000; i += m) {
    //     REP(j, 0, m - 1) cout << ((i + j)  * 2) % m << ' ';
    //     cout << ln;
    // }
}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

strange_device.cpp: In function 'void readip()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:144:5: note: in expansion of macro 'REP'
  144 |     REP(i, 1, n) cin >> l[i] >> r[i];
      |     ^~~
strange_device.cpp: In function 'bool sub1::check()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:150:9: note: in expansion of macro 'REP'
  150 |         REP(i, 1, n) s += r[i] - l[i] + 1;
      |         ^~~
strange_device.cpp: In function 'void sub1::solve()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:156:9: note: in expansion of macro 'REP'
  156 |         REP(i, 1, n) {
      |         ^~~
strange_device.cpp: In function 'void sub2::solve()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:170:9: note: in expansion of macro 'REP'
  170 |         REP(i, 1, n) {
      |         ^~~
strange_device.cpp:178:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  178 |         for (auto [l, r] : segment) {
      |                   ^
strange_device.cpp: In function 'void file()':
strange_device.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 25 ms 8148 KB Output is correct
3 Correct 33 ms 11984 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 6 ms 3548 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 33 ms 10960 KB Output is correct
16 Correct 13 ms 5012 KB Output is correct
17 Correct 33 ms 8912 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 62 ms 19660 KB Output is correct
3 Correct 75 ms 20680 KB Output is correct
4 Correct 66 ms 20168 KB Output is correct
5 Incorrect 171 ms 16004 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 295 ms 32496 KB Output is correct
3 Correct 299 ms 32496 KB Output is correct
4 Correct 296 ms 71616 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 295 ms 32496 KB Output is correct
3 Correct 299 ms 32496 KB Output is correct
4 Correct 296 ms 71616 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 232 ms 53192 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 295 ms 32496 KB Output is correct
3 Correct 299 ms 32496 KB Output is correct
4 Correct 296 ms 71616 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Incorrect 24 ms 10472 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 23 ms 6672 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 25 ms 8148 KB Output is correct
3 Correct 33 ms 11984 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 6 ms 3548 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 33 ms 10960 KB Output is correct
16 Correct 13 ms 5012 KB Output is correct
17 Correct 33 ms 8912 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Halted 0 ms 0 KB -