Submission #933217

#TimeUsernameProblemLanguageResultExecution timeMemory
933217sleepntsheepStrange Device (APIO19_strange_device)C++17
10 / 100
623 ms524288 KiB
#include <iostream> #include <fstream> #include <iomanip> #include <cmath> #include <cassert> #include <cstring> #include <vector> #include <algorithm> #include <deque> #include <set> #include <utility> #include <array> #include <complex> using u32 = unsigned; using i32 = int; using i64 = long long; using u64 = unsigned long long; using f64 = double; using f80 = long double; using namespace std; using pt = complex<f80>; #define ALL(x) begin(x), end(x) #define ShinLena cin.tie(nullptr)->sync_with_stdio(false); #define N 400005 i64 n, a, b, l[N], r[N]; int main() { ShinLena; cin >> n >> a >> b; for (int i = 0; i < n; ++i) cin >> l[i] >> r[i]; vector<pair<i64, i64>> v; for (int i = 0; i < n; ++i) { for (i64 j = l[i]; j <= r[i]; ++j) { v.push_back({(j+j/b)%a, j%b}); } } sort(ALL(v)); cout << unique(ALL(v)) - begin(v); return 0; }
#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...