oj.uz

Submission #252113

# Submission time Handle Problem Language Result Execution time Memory
252113 2020-07-24T08:41:32 Z khangal Strange Device (APIO19_strange_device) C++14
10 / 100
 5000 ms 524292 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,x,y,r,z,h,a[1234567],w,c1[1234][1234];
bool used[1234567],used1[1234567];
pl p[1234567];
string s,s1[1234567];
map<ll,ll> mp;
map<pl,ll> mpl;
vl vec,vec1,ansvec;
vector<ll> v[1234567],v1[1234567];
vector<ll> vp[1234567];
set<pl> st;
int main(){
    ll A,B;
    cin>>n>>A>>B;
    while(n--){
        cin>>l>>r;
        for(ll i=l;i<=r;i++){
            x = (i+(i/B))%A;
            y = i%B;
            st.insert({x,y});
        }
    }
    cout<<st.size();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 126072 KB Output is correct
2 Correct 131 ms 137976 KB Output is correct
3 Correct 170 ms 143608 KB Output is correct
4 Correct 77 ms 126584 KB Output is correct
5 Correct 66 ms 125944 KB Output is correct
6 Correct 73 ms 126076 KB Output is correct
7 Correct 63 ms 126072 KB Output is correct
8 Correct 71 ms 126200 KB Output is correct
9 Correct 72 ms 126840 KB Output is correct
10 Correct 70 ms 125944 KB Output is correct
11 Correct 66 ms 125944 KB Output is correct
12 Correct 77 ms 125944 KB Output is correct
13 Correct 94 ms 125944 KB Output is correct
14 Correct 70 ms 125944 KB Output is correct
15 Correct 123 ms 132728 KB Output is correct
16 Correct 136 ms 132344 KB Output is correct
17 Correct 313 ms 132216 KB Output is correct
18 Correct 72 ms 125944 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 125944 KB Output is correct
2 Runtime error 2640 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 125944 KB Output is correct
2 Correct 241 ms 158072 KB Output is correct
3 Correct 271 ms 157688 KB Output is correct
4 Correct 228 ms 156280 KB Output is correct
5 Execution timed out 5063 ms 188280 KB Time limit exceeded

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 125944 KB Output is correct
2 Correct 2338 ms 188540 KB Output is correct
3 Runtime error 1597 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 125944 KB Output is correct
2 Correct 2338 ms 188540 KB Output is correct
3 Runtime error 1597 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 125944 KB Output is correct
2 Correct 2338 ms 188540 KB Output is correct
3 Runtime error 1597 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 125816 KB Output is correct
2 Runtime error 1220 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 126072 KB Output is correct
2 Correct 131 ms 137976 KB Output is correct
3 Correct 170 ms 143608 KB Output is correct
4 Correct 77 ms 126584 KB Output is correct
5 Correct 66 ms 125944 KB Output is correct
6 Correct 73 ms 126076 KB Output is correct
7 Correct 63 ms 126072 KB Output is correct
8 Correct 71 ms 126200 KB Output is correct
9 Correct 72 ms 126840 KB Output is correct
10 Correct 70 ms 125944 KB Output is correct
11 Correct 66 ms 125944 KB Output is correct
12 Correct 77 ms 125944 KB Output is correct
13 Correct 94 ms 125944 KB Output is correct
14 Correct 70 ms 125944 KB Output is correct
15 Correct 123 ms 132728 KB Output is correct
16 Correct 136 ms 132344 KB Output is correct
17 Correct 313 ms 132216 KB Output is correct
18 Correct 72 ms 125944 KB Output is correct
19 Correct 68 ms 125944 KB Output is correct
20 Runtime error 2640 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -