oj.uz

Submission #782481

# Submission time Handle Problem Language Result Execution time Memory
782481 2023-07-14T02:59:27 Z christinelynn Strange Device (APIO19_strange_device) C++17
65 / 100
 569 ms 33860 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);
  LL 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 4 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 1 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 52 ms 5180 KB Output is correct
18 Correct 1 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 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 274 ms 33160 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 425 ms 33148 KB Output is correct
3 Correct 462 ms 33728 KB Output is correct
4 Correct 444 ms 33672 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 425 ms 33148 KB Output is correct
3 Correct 462 ms 33728 KB Output is correct
4 Correct 444 ms 33672 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 453 ms 33860 KB Output is correct
7 Correct 427 ms 33720 KB Output is correct
8 Correct 433 ms 33744 KB Output is correct
9 Correct 557 ms 33672 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 425 ms 33148 KB Output is correct
3 Correct 462 ms 33728 KB Output is correct
4 Correct 444 ms 33672 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 41 ms 5040 KB Output is correct
7 Correct 43 ms 5028 KB Output is correct
8 Correct 51 ms 4924 KB Output is correct
9 Correct 41 ms 4996 KB Output is correct
10 Correct 56 ms 4924 KB Output is correct
11 Correct 44 ms 4964 KB Output is correct
12 Correct 39 ms 5036 KB Output is correct
13 Correct 45 ms 4980 KB Output is correct
14 Correct 43 ms 5040 KB Output is correct
15 Correct 47 ms 4976 KB Output is correct
16 Correct 54 ms 5004 KB Output is correct
17 Correct 50 ms 5036 KB Output is correct
18 Correct 457 ms 33724 KB Output is correct
19 Correct 443 ms 33712 KB Output is correct
20 Correct 537 ms 33664 KB Output is correct
21 Correct 55 ms 4932 KB Output is correct
22 Correct 41 ms 5000 KB Output is correct
23 Correct 118 ms 17256 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 46 ms 4800 KB Output is correct
3 Correct 48 ms 5000 KB Output is correct
4 Correct 569 ms 33708 KB Output is correct
5 Correct 45 ms 4992 KB Output is correct
6 Correct 45 ms 5032 KB Output is correct
7 Correct 57 ms 5196 KB Output is correct
8 Correct 48 ms 4932 KB Output is correct
9 Correct 44 ms 4896 KB Output is correct
10 Correct 47 ms 4952 KB Output is correct
11 Correct 45 ms 4956 KB Output is correct
12 Correct 40 ms 5044 KB Output is correct
13 Correct 47 ms 5004 KB Output is correct
14 Correct 489 ms 33708 KB Output is correct
15 Correct 50 ms 5000 KB Output is correct
16 Correct 423 ms 33764 KB Output is correct
17 Correct 458 ms 33760 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 4 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 1 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 52 ms 5180 KB Output is correct
18 Correct 1 ms 212 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 -