oj.uz

답안 #972433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972433 2024-04-30T12:08:35 Z simona1230 이상한 기계 (APIO19_strange_device) C++17
65 / 100
 329 ms 17520 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;
    if(1e18/a>=b)h=b*(a*(b+1)/__gcd(a,b+1)/(b+1));
    if(h<0)h=1e18+1;
    //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 348 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 31 ms 2652 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 183 ms 16980 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 272 ms 17016 KB Output is correct
3 Correct 266 ms 16976 KB Output is correct
4 Correct 300 ms 17260 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 272 ms 17016 KB Output is correct
3 Correct 266 ms 16976 KB Output is correct
4 Correct 300 ms 17260 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 271 ms 17036 KB Output is correct
7 Correct 277 ms 17520 KB Output is correct
8 Correct 262 ms 17028 KB Output is correct
9 Correct 297 ms 17012 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 272 ms 17016 KB Output is correct
3 Correct 266 ms 16976 KB Output is correct
4 Correct 300 ms 17260 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 29 ms 2652 KB Output is correct
7 Correct 29 ms 2652 KB Output is correct
8 Correct 29 ms 2652 KB Output is correct
9 Correct 27 ms 2652 KB Output is correct
10 Correct 28 ms 2652 KB Output is correct
11 Correct 28 ms 2648 KB Output is correct
12 Correct 26 ms 2652 KB Output is correct
13 Correct 29 ms 2652 KB Output is correct
14 Correct 28 ms 2652 KB Output is correct
15 Correct 35 ms 2904 KB Output is correct
16 Correct 30 ms 2692 KB Output is correct
17 Correct 29 ms 2668 KB Output is correct
18 Correct 280 ms 17004 KB Output is correct
19 Correct 270 ms 17012 KB Output is correct
20 Correct 304 ms 17008 KB Output is correct
21 Correct 33 ms 2916 KB Output is correct
22 Correct 26 ms 2652 KB Output is correct
23 Correct 83 ms 6524 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 29 ms 2652 KB Output is correct
3 Correct 29 ms 2652 KB Output is correct
4 Correct 329 ms 17024 KB Output is correct
5 Correct 30 ms 2652 KB Output is correct
6 Correct 29 ms 2652 KB Output is correct
7 Correct 31 ms 2688 KB Output is correct
8 Correct 35 ms 2652 KB Output is correct
9 Correct 35 ms 2652 KB Output is correct
10 Correct 30 ms 2652 KB Output is correct
11 Correct 29 ms 2652 KB Output is correct
12 Correct 26 ms 2900 KB Output is correct
13 Correct 30 ms 2900 KB Output is correct
14 Correct 309 ms 16980 KB Output is correct
15 Correct 35 ms 2652 KB Output is correct
16 Correct 268 ms 17016 KB Output is correct
17 Correct 307 ms 16980 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #8
0 / 30.0

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