oj.uz

답안 #972438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972438 2024-04-30T12:26:06 Z simona1230 이상한 기계 (APIO19_strange_device) C++17
65 / 100
 352 ms 36484 KB 
#include <bits/stdc++.h>

using namespace std;
long long n,a,b;
map<pair<long long,long long>,long long> mp;
void help()
{

    for(long long t=0;t<=110;t++)
    {
        long long x=(t+t/b)%a,y=t%b;
        if(mp[{x,y}])
            {
                cout<<t<<" "<<x<<" "<<y<<" "<<mp[{x,y}]<<endl;
            }
        mp[{x,y}]=t+1;
    }
}

pair<long long,long long> p[2000001];
void solve()
{
    int cnt=n;
    long long h=1e18+1;
    a/=__gcd(a,b+1);
    if(1e18/a>=b)h=b*a;
    //cout<<h<<endl;
    for(long long i=1;i<=n;i++)
    {
        long long l,r;
        cin>>l>>r;
        p[i]={l%(h),r%(h)};
        if(p[i].first>p[i].second)
        {
            cnt++;
            p[cnt].first=0;
            p[cnt].second=p[i].second;

            p[i].second=h-1;
        }
    }
    long long ans=0;
    sort(p+1,p+cnt+1);

    long long r=-1;
    for(long long i=1;i<=cnt;i++)
    {
        if(p[i].second>r)
        {
            if(p[i].first>r)
                ans+=p[i].second-p[i].first+1;
            else ans+=p[i].second-r;
        }

        r=max(r,p[i].second);
    }

    cout<<ans<<endl;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>n>>a>>b;

	//help();
	solve();
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 856 KB Output is correct
3 Correct 5 ms 1004 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 356 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 0 ms 356 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 0 ms 356 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 34 ms 4988 KB Output is correct
18 Correct 0 ms 356 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 356 KB Output is correct
2 Incorrect 1 ms 356 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 1 ms 524 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 608 KB Output is correct
5 Correct 203 ms 30000 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 310 ms 36484 KB Output is correct
3 Correct 298 ms 35884 KB Output is correct
4 Correct 306 ms 35948 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 310 ms 36484 KB Output is correct
3 Correct 298 ms 35884 KB Output is correct
4 Correct 306 ms 35948 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 286 ms 35792 KB Output is correct
7 Correct 287 ms 36044 KB Output is correct
8 Correct 300 ms 35972 KB Output is correct
9 Correct 352 ms 36160 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 310 ms 36484 KB Output is correct
3 Correct 298 ms 35884 KB Output is correct
4 Correct 306 ms 35948 KB Output is correct
5 Correct 1 ms 544 KB Output is correct
6 Correct 30 ms 4776 KB Output is correct
7 Correct 32 ms 4948 KB Output is correct
8 Correct 29 ms 4964 KB Output is correct
9 Correct 30 ms 4984 KB Output is correct
10 Correct 30 ms 4956 KB Output is correct
11 Correct 31 ms 4972 KB Output is correct
12 Correct 29 ms 4948 KB Output is correct
13 Correct 30 ms 4956 KB Output is correct
14 Correct 29 ms 4956 KB Output is correct
15 Correct 31 ms 4724 KB Output is correct
16 Correct 31 ms 4948 KB Output is correct
17 Correct 30 ms 4956 KB Output is correct
18 Correct 309 ms 36260 KB Output is correct
19 Correct 277 ms 35920 KB Output is correct
20 Correct 334 ms 35840 KB Output is correct
21 Correct 30 ms 4948 KB Output is correct
22 Correct 32 ms 4948 KB Output is correct
23 Correct 85 ms 13660 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 34 ms 4764 KB Output is correct
3 Correct 32 ms 4948 KB Output is correct
4 Correct 340 ms 35976 KB Output is correct
5 Correct 35 ms 4972 KB Output is correct
6 Correct 38 ms 4944 KB Output is correct
7 Correct 31 ms 4944 KB Output is correct
8 Correct 33 ms 4832 KB Output is correct
9 Correct 30 ms 4820 KB Output is correct
10 Correct 33 ms 4928 KB Output is correct
11 Correct 33 ms 4916 KB Output is correct
12 Correct 27 ms 4852 KB Output is correct
13 Correct 32 ms 4928 KB Output is correct
14 Correct 337 ms 35852 KB Output is correct
15 Correct 31 ms 5024 KB Output is correct
16 Correct 303 ms 36132 KB Output is correct
17 Correct 281 ms 35924 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 856 KB Output is correct
3 Correct 5 ms 1004 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 356 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 0 ms 356 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 0 ms 356 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 34 ms 4988 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Incorrect 1 ms 356 KB Output isn't correct
21 Halted 0 ms 0 KB -