# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404971 | 2021-05-15T12:25:15 Z | A_D | Strange Device (APIO19_strange_device) | C++14 | 1 ms | 204 KB |
#include <bits/stdc++.h> #define int long long #define ii pair<int,int> #define F first #define S second #define du long double using namespace std; const int N=1e6+100; ii a[N]; vector<int> l; vector<int> r; vector<ii> b; set<ii> st; void solve() { int n,A,B; cin>>n>>A>>B; int u=A*B; int m=A/2; if(A%2)m=u; // cout<<5<<endl; for(int i=1;i<=n;i++){ scanf("%lld",&a[i].F); scanf("%lld",&a[i].S); a[i].F%=u; a[i].S%=u; a[i].F%=m; a[i].S%=m; // cout<<a[i].F<<" "<<a[i].S<<endl; if(a[i].S<a[i].F){ b.push_back({a[i].F,m-1}); b.push_back({(int)0,a[i].S}); } else{ b.push_back({a[i].F,a[i].S}); } } sort(b.begin(),b.end()); cout<<5<<endl; l.push_back(b[0].F); r.push_back(b[0].S); for(int i=1;i<b.size();i++){ // cout<<b[i].F<<" "<<b[i].S<<endl; int ll=l.back(); int rr=r.back(); if(!(ll>b[i].S||rr<b[i].F)){ // cout<<ll<<" "<<rr<<" "<<b[i].F<<" "<<b[i].S<<endl; l.pop_back(); r.pop_back(); l.push_back(min(ll,b[i].F)); r.push_back(max(rr,b[i].S)); } else{ l.push_back(b[i].F); r.push_back(b[i].S); } } // cout<<"\n\n"; // for(int i=0;i<l.size();i++)cout<<l[i]<<" "<<r[i]<<endl; //cout<<"\n\n"; int ans=0; for(int j=0;j<l.size();j++){ // cout<<l[j]<<" "<<r[j]<<endl; ans+=r[j]-l[j]+1; } // cout<<"\n\n"; // cout<<st.size()<<endl; cout<<ans<<endl; } main() { int t=1; //cin>>t; while(t--)solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |