Submission #677168

#TimeUsernameProblemLanguageResultExecution timeMemory
677168faribourzStrange Device (APIO19_strange_device)C++14
0 / 100
2280 ms524288 KiB
// Only GOD // believe in yourself // nemidam del be in darde donya! #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; #define F first #define S second #define pb push_back #define all(x) x.begin(), x.end() #define bit(x, y) ((x >> y)&1) #define sz(x) (int)x.size() #define kill(x) return cout << x << '\n', void() #define KILL(x) return cout << x << '\n', 0 #define int ll const int N = 1e5+10; const int INF = INT_MAX; int32_t main(){ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n, A, B; cin >> n >> A >> B; int C = A / __gcd(A, B+1); if(C < B){ int sum = 0; for(int i = 0; i < n; i++){ int l, r; cin >> l >> r; sum += r - l + 1; } KILL(sum); } int mul = C*B; set<int> s; for(int i = 0; i < n; i++){ int l, r; cin >> l >> r; for(int j = l; j <= r; j++){ s.insert(j % mul); } } cout << sz(s) << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...