Submission #622525

#TimeUsernameProblemLanguageResultExecution timeMemory
622525bigo이상한 기계 (APIO19_strange_device)C++14
0 / 100
5059 ms524288 KiB
#define _CRT_SECURE_NO_WARNINGS #include <string> #include <iostream> #include <vector> #include <map> using namespace std; typedef long long ll; typedef pair<ll, ll> pii; const ll mod = 1e9 + 7; const ll mod1 = 998244353; #define all(a) a.begin(),a.end() int main() { int n, a, b; cin >> n >> a >> b; vector<pii>vec(n); for (int i = 0; i < n; i++) cin >> vec[i].first >> vec[i].second; map<pii, int>mp; int ans = 0; for (int i = 0; i < n; i++) { for (int j = vec[i].first; j <= vec[i].second; j++) { int x = (j + j / b) % a; int y = j % b; if (mp.count({ x,y })==0) { ans++; mp[{x, y}] = 1; } } } cout << ans << endl; }
#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...