oj.uz

Submission #782501

# Submission time Handle Problem Language Result Execution time Memory
782501 2023-07-14T03:12:46 Z makanhulia Strange Device (APIO19_strange_device) C++17
65 / 100
 569 ms 33932 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=(__int128_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 6 ms 976 KB Output is correct
3 Correct 5 ms 932 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 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 0 ms 212 KB Output is correct
16 Correct 5 ms 1164 KB Output is correct
17 Correct 49 ms 4788 KB Output is correct
18 Correct 1 ms 300 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 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 278 ms 33228 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 443 ms 33188 KB Output is correct
3 Correct 442 ms 33168 KB Output is correct
4 Correct 460 ms 33796 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 443 ms 33188 KB Output is correct
3 Correct 442 ms 33168 KB Output is correct
4 Correct 460 ms 33796 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 442 ms 33700 KB Output is correct
7 Correct 434 ms 33700 KB Output is correct
8 Correct 445 ms 33600 KB Output is correct
9 Correct 497 ms 33932 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 443 ms 33188 KB Output is correct
3 Correct 442 ms 33168 KB Output is correct
4 Correct 460 ms 33796 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 42 ms 4816 KB Output is correct
7 Correct 43 ms 4908 KB Output is correct
8 Correct 49 ms 4944 KB Output is correct
9 Correct 50 ms 4880 KB Output is correct
10 Correct 48 ms 4948 KB Output is correct
11 Correct 43 ms 4896 KB Output is correct
12 Correct 40 ms 4860 KB Output is correct
13 Correct 48 ms 5072 KB Output is correct
14 Correct 47 ms 4984 KB Output is correct
15 Correct 49 ms 5004 KB Output is correct
16 Correct 47 ms 4864 KB Output is correct
17 Correct 42 ms 4896 KB Output is correct
18 Correct 443 ms 33708 KB Output is correct
19 Correct 423 ms 33684 KB Output is correct
20 Correct 527 ms 33680 KB Output is correct
21 Correct 48 ms 4880 KB Output is correct
22 Correct 38 ms 4732 KB Output is correct
23 Correct 117 ms 17292 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 44 ms 4536 KB Output is correct
3 Correct 44 ms 4424 KB Output is correct
4 Correct 569 ms 33300 KB Output is correct
5 Correct 43 ms 4540 KB Output is correct
6 Correct 43 ms 4412 KB Output is correct
7 Correct 45 ms 4496 KB Output is correct
8 Correct 46 ms 4456 KB Output is correct
9 Correct 42 ms 4428 KB Output is correct
10 Correct 46 ms 4484 KB Output is correct
11 Correct 43 ms 4500 KB Output is correct
12 Correct 40 ms 4512 KB Output is correct
13 Correct 48 ms 4916 KB Output is correct
14 Correct 488 ms 33640 KB Output is correct
15 Correct 60 ms 4944 KB Output is correct
16 Correct 416 ms 33572 KB Output is correct
17 Correct 440 ms 33708 KB Output is correct
18 Correct 1 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 6 ms 976 KB Output is correct
3 Correct 5 ms 932 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 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 0 ms 212 KB Output is correct
16 Correct 5 ms 1164 KB Output is correct
17 Correct 49 ms 4788 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 0 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -