#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>
#include <cstdint>
#include <limits>
#include <numeric>
#include <iostream>
using namespace std;
#define int long long
pair<int, int> get(int t, int a, int b)
{
int x = (t + t / b) % a;
int y = t % b;
return { x, y };
}
bool same_dumb(int t1, int t2, int a, int b)
{
return get(t1, a, b) == get(t2, a, b);
}
int gcd(int a, int b)
{
if (b == 0) return a;
return gcd(b, a % b);
}
const int lim = 20;
void print(vector<int> v)
{
cout << " ---> ";
for (auto& x : v)
{
cout << x << " ";
}
cout << "\n";
}
void solve()
{
int n, mod;
cin >> n;
{
int a, b;
cin >> a >> b;
a /= gcd(a, b + 1);
if (a <= ((int)1e18 + 7) / b)
{
a *= b;
mod = a;
}
else
{
mod = ((int)1e18 + 7);
}
}
set<int> s;
vector<pair<int, int>> segs(n);
for (auto& it : segs)
{
cin >> it.first >> it.second;
int bag = 0;
for (int j = it.first; j <= it.second; j++)
{
bag++;
s.insert(j % mod);
}
assert(mod >= 0);
if (bag >= mod)
{
// assert((int)s.size() == mod);
}
}
cout << (int)s.size() << "\n";
exit(0);
}
signed main()
{
#ifdef ONPC
FILE* stream;
freopen_s(&stream, "input.txt", "r", stdin);
#else
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
34 ms |
9472 KB |
Output is correct |
3 |
Correct |
53 ms |
13612 KB |
Output is correct |
4 |
Correct |
2 ms |
724 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
4 ms |
980 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
26 ms |
5348 KB |
Output is correct |
16 |
Correct |
22 ms |
5228 KB |
Output is correct |
17 |
Correct |
56 ms |
6576 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Runtime error |
3827 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
81 ms |
24248 KB |
Output is correct |
3 |
Correct |
82 ms |
24108 KB |
Output is correct |
4 |
Correct |
79 ms |
23004 KB |
Output is correct |
5 |
Execution timed out |
5019 ms |
62664 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
491 ms |
62948 KB |
Output is correct |
3 |
Runtime error |
2249 ms |
524288 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
491 ms |
62948 KB |
Output is correct |
3 |
Runtime error |
2249 ms |
524288 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
491 ms |
62948 KB |
Output is correct |
3 |
Runtime error |
2249 ms |
524288 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Runtime error |
2294 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
34 ms |
9472 KB |
Output is correct |
3 |
Correct |
53 ms |
13612 KB |
Output is correct |
4 |
Correct |
2 ms |
724 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
4 ms |
980 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
26 ms |
5348 KB |
Output is correct |
16 |
Correct |
22 ms |
5228 KB |
Output is correct |
17 |
Correct |
56 ms |
6576 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Runtime error |
3827 ms |
524288 KB |
Execution killed with signal 9 |
21 |
Halted |
0 ms |
0 KB |
- |