oj.uz

Submission #782551

# Submission time Handle Problem Language Result Execution time Memory
782551 2023-07-14T05:04:04 Z andecaandeci Strange Device (APIO19_strange_device) C++17
65 / 100
 1251 ms 33364 KB 
#include <bits/stdc++.h>
#define LL long long 
LL INF =2e18; 
using namespace std;
int main()
{
  LL n,a,b;
  cin>>n>>a>>b;
  LL t = (a/__gcd(b+1,a));
  if(t<0)t=1e18+5;
  vector<pair<LL,LL>>v;
  if(INF/t<=b)t=INF;
  else t=t*b;
//  printf("t=%lld\n",t);
  for(LL a=1;a<=n;a++)
  {
    LL l,r;
    cin>>l>>r;
    LL temp=l,temp2=r;
    l%=t ,r%=t;
    if(l==r)
    {
      if(temp==temp2)
      {
        v.push_back(make_pair(l,0));
        v.push_back(make_pair(r,1));
      }
      else
      {
        v.push_back(make_pair(0,0));
        v.push_back(make_pair(t-1,1));
       } 
    }
    else if(l>r)
    {
  //    printf("->%lld,%lld\n-> 0 %lld\n",l,t-1,r);
    //  v.push_back(make_pair(l,t-1));
      v.push_back(make_pair(l,0));
      v.push_back(make_pair(t-1,1));
    //  v.push_back(make_pair(0,r));
      v.push_back(make_pair(0,0));
      v.push_back(make_pair(r,1));
    }
    else
    {
      v.push_back(make_pair(l,0));
        v.push_back(make_pair(r,1));
     } 

  }
  sort(v.begin(),v.end());
  LL kanan=0,tot=0,kiri=0,cnt=0;
  for(pair<LL,LL>x:v)
  {
    if(x.second==0)
    {
      cnt++;
      if(cnt==1)kiri=x.first;
    }
    else
    {
      cnt--;
      if(cnt==0)tot+=(x.first-kiri+1);
    }
  }
  cout<<tot<<endl;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:52:6: warning: unused variable 'kanan' [-Wunused-variable]
   52 |   LL kanan=0,tot=0,kiri=0,cnt=0;
      |      ^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 11 ms 832 KB Output is correct
3 Correct 12 ms 884 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 11 ms 904 KB Output is correct
17 Correct 120 ms 4532 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 776 ms 33196 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1062 ms 33132 KB Output is correct
3 Correct 1089 ms 33284 KB Output is correct
4 Correct 1050 ms 33292 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1062 ms 33132 KB Output is correct
3 Correct 1089 ms 33284 KB Output is correct
4 Correct 1050 ms 33292 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1088 ms 33236 KB Output is correct
7 Correct 1092 ms 33252 KB Output is correct
8 Correct 1061 ms 33216 KB Output is correct
9 Correct 1136 ms 33192 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1062 ms 33132 KB Output is correct
3 Correct 1089 ms 33284 KB Output is correct
4 Correct 1050 ms 33292 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 104 ms 4496 KB Output is correct
7 Correct 109 ms 4520 KB Output is correct
8 Correct 103 ms 4412 KB Output is correct
9 Correct 119 ms 4504 KB Output is correct
10 Correct 103 ms 4488 KB Output is correct
11 Correct 112 ms 4536 KB Output is correct
12 Correct 102 ms 4424 KB Output is correct
13 Correct 109 ms 4424 KB Output is correct
14 Correct 106 ms 4512 KB Output is correct
15 Correct 109 ms 4524 KB Output is correct
16 Correct 112 ms 4788 KB Output is correct
17 Correct 104 ms 4480 KB Output is correct
18 Correct 1077 ms 33284 KB Output is correct
19 Correct 1057 ms 33288 KB Output is correct
20 Correct 1159 ms 33364 KB Output is correct
21 Correct 109 ms 4408 KB Output is correct
22 Correct 101 ms 4528 KB Output is correct
23 Correct 333 ms 16784 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 119 ms 4572 KB Output is correct
3 Correct 110 ms 4472 KB Output is correct
4 Correct 1251 ms 33184 KB Output is correct
5 Correct 115 ms 4468 KB Output is correct
6 Correct 119 ms 4676 KB Output is correct
7 Correct 109 ms 4540 KB Output is correct
8 Correct 111 ms 4472 KB Output is correct
9 Correct 109 ms 4532 KB Output is correct
10 Correct 114 ms 4452 KB Output is correct
11 Correct 109 ms 4532 KB Output is correct
12 Correct 105 ms 4492 KB Output is correct
13 Correct 139 ms 4536 KB Output is correct
14 Correct 1162 ms 33244 KB Output is correct
15 Correct 111 ms 4408 KB Output is correct
16 Correct 1097 ms 33288 KB Output is correct
17 Correct 1066 ms 33356 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 11 ms 832 KB Output is correct
3 Correct 12 ms 884 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 11 ms 904 KB Output is correct
17 Correct 120 ms 4532 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Incorrect 0 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -