oj.uz

Submission #782485

# Submission time Handle Problem Language Result Execution time Memory
782485 2023-07-14T03:03:51 Z christinelynn Strange Device (APIO19_strange_device) C++17
65 / 100
 568 ms 33436 KB 
#include <bits/stdc++.h>
#define LL long long 
using namespace std;
int main()
{
  LL n,a,b;
  scanf("%lld %lld %lld",&n,&a,&b);
  __int128_t t=b*(a/__gcd(b+1,a));
  vector<pair<LL,LL>>v;
//  printf("t=%lld\n",t);
  for(LL a=1;a<=n;a++)
  {
    LL l,r;
    scanf("%lld %lld",&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:48:6: warning: unused variable 'kanan' [-Wunused-variable]
   48 |   LL kanan=0,tot=0,kiri=0,cnt=0;
      |      ^~~~~
strange_device.cpp:7:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |   scanf("%lld %lld %lld",&n,&a,&b);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%lld %lld",&l,&r);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 5 ms 848 KB Output is correct
3 Correct 4 ms 848 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 46 ms 4480 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 0 ms 212 KB Output is correct
2 Incorrect 1 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 295 ms 33220 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 439 ms 33224 KB Output is correct
3 Correct 434 ms 33168 KB Output is correct
4 Correct 416 ms 33320 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 439 ms 33224 KB Output is correct
3 Correct 434 ms 33168 KB Output is correct
4 Correct 416 ms 33320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 436 ms 33192 KB Output is correct
7 Correct 422 ms 33172 KB Output is correct
8 Correct 425 ms 33196 KB Output is correct
9 Correct 482 ms 33196 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 439 ms 33224 KB Output is correct
3 Correct 434 ms 33168 KB Output is correct
4 Correct 416 ms 33320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 41 ms 4536 KB Output is correct
7 Correct 41 ms 4412 KB Output is correct
8 Correct 50 ms 4608 KB Output is correct
9 Correct 39 ms 4548 KB Output is correct
10 Correct 37 ms 4548 KB Output is correct
11 Correct 40 ms 4464 KB Output is correct
12 Correct 37 ms 4460 KB Output is correct
13 Correct 43 ms 4540 KB Output is correct
14 Correct 40 ms 4476 KB Output is correct
15 Correct 45 ms 4472 KB Output is correct
16 Correct 44 ms 4548 KB Output is correct
17 Correct 39 ms 4500 KB Output is correct
18 Correct 443 ms 33196 KB Output is correct
19 Correct 411 ms 33436 KB Output is correct
20 Correct 510 ms 33236 KB Output is correct
21 Correct 44 ms 4440 KB Output is correct
22 Correct 35 ms 4504 KB Output is correct
23 Correct 112 ms 16800 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 42 ms 4428 KB Output is correct
3 Correct 42 ms 4552 KB Output is correct
4 Correct 568 ms 33176 KB Output is correct
5 Correct 42 ms 4440 KB Output is correct
6 Correct 42 ms 4528 KB Output is correct
7 Correct 42 ms 4444 KB Output is correct
8 Correct 44 ms 4472 KB Output is correct
9 Correct 41 ms 4532 KB Output is correct
10 Correct 50 ms 4664 KB Output is correct
11 Correct 43 ms 4460 KB Output is correct
12 Correct 39 ms 4404 KB Output is correct
13 Correct 44 ms 4548 KB Output is correct
14 Correct 468 ms 33204 KB Output is correct
15 Correct 48 ms 4468 KB Output is correct
16 Correct 393 ms 33212 KB Output is correct
17 Correct 430 ms 33196 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 5 ms 848 KB Output is correct
3 Correct 4 ms 848 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 46 ms 4480 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 1 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -