QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#293920	#5259. Skills in Pills	LaStataleBlue^#	TL	301ms	3716kb	C++23	1.5kb	2023-12-29 22:59:22	2023-12-29 22:59:22

Judging History

你现在查看的是最新测评结果

[2023-12-29 22:59:22]
评测

测评结果：TL
用时：301ms
内存：3716kb

查看

[2023-12-29 22:59:22]
提交

answer

#include<bits/stdc++.h>
using namespace std;

void solve(int t){
    int k,j,n;
    cin>>k>>j>>n;
    
    int lcm = k*j/__gcd(k,j);
    
    if(k<j)swap(k,j);
    
    int res=1e7;
    
    for(int st=1;st<=k;st++){
        for(int st2=1;st2<=j;st2++){
            for(int par=0;par<4;par++){
                int ans=0;
                
                int pos1=st,pos2=st2;
                int cont=0;
                
                while(pos1<=n || pos2<=n){
                    if(pos1<pos2){
                        ans++;
                        pos1+=k;
                    }else if(pos2<pos1){
                        ans++;
                        pos2+=j;
                    }else{
                        ans+=2;
                        
                        if(par==3)pos1--;
                        else if(par==4)pos2--;
                        else if(cont%2==par){
                            pos1--;
                        }else{
                            pos2--;
                        }
                        cont++;
                        
                        pos1+=k;
                        pos2+=j;
                    }
                }
                
                res=min(ans,res);
            }
            //cout<<ans<<"\n";
        }
    }
    cout<<res<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3656kb

input:

3 9 20

output:

result:

ok single line: '8'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3572kb

input:

8 2 12

output:

result:

ok single line: '7'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3692kb

input:

2 5 15

output:

result:

ok single line: '10'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

10 8 13

output:

result:

ok single line: '2'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3568kb

input:

6 6 19

output:

result:

ok single line: '6'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3580kb

input:

2 3 5

output:

result:

ok single line: '3'

Test #7:

score: 0

Accepted

time: 0ms

memory: 3576kb

input:

4 2 8

output:

result:

ok single line: '6'

Test #8:

score: 0

Accepted

time: 0ms

memory: 3604kb

input:

5 5 5

output:

result:

ok single line: '2'

Test #9:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

3 8 11

output:

result:

ok single line: '4'

Test #10:

score: 0

Accepted

time: 0ms

memory: 3576kb

input:

5 8 16

output:

result:

ok single line: '5'

Test #11:

score: 0

Accepted

time: 0ms

memory: 3700kb

input:

9 7 279

output:

result:

ok single line: '70'

Test #12:

score: 0

Accepted

time: 0ms

memory: 3576kb

input:

8 3 56

output:

result:

ok single line: '25'

Test #13:

score: 0

Accepted

time: 0ms

memory: 3620kb

input:

5 9 46

output:

result:

ok single line: '14'

Test #14:

score: 0

Accepted

time: 0ms

memory: 3584kb

input:

8 4 251

output:

result:

ok single line: '93'

Test #15:

score: 0

Accepted

time: 0ms

memory: 3628kb

input:

8 7 41

output:

result:

ok single line: '10'

Test #16:

score: 0

Accepted

time: 0ms

memory: 3628kb

input:

60 17 360

output:

result:

ok single line: '27'

Test #17:

score: 0

Accepted

time: 1ms

memory: 3576kb

input:

16 55 388

output:

result:

ok single line: '31'

Test #18:

score: 0

Accepted

time: 0ms

memory: 3696kb

input:

25 38 292

output:

result:

ok single line: '18'

Test #19:

score: 0

Accepted

time: 0ms

memory: 3708kb

input:

22 59 177

output:

result:

ok single line: '11'

Test #20:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

4 3 82

output:

result:

ok single line: '50'

Test #21:

score: 0

Accepted

time: 152ms

memory: 3636kb

input:

77 18 511543

output:

result:

ok single line: '35070'

Test #22:

score: 0

Accepted

time: 174ms

memory: 3656kb

input:

37 32 987861

output:

result:

ok single line: '57612'

Test #23:

score: 0

Accepted

time: 36ms

memory: 3712kb

input:

29 8 300899

output:

result:

ok single line: '48059'

Test #24:

score: 0

Accepted

time: 211ms

memory: 3636kb

input:

73 83 533839

output:

result:

ok single line: '13745'

Test #25:

score: 0

Accepted

time: 20ms

memory: 3716kb

input:

12 23 181193

output:

result:

ok single line: '23008'

Test #26:

score: 0

Accepted

time: 5ms

memory: 3576kb

input:

2 2 864514

output:

result:

ok single line: '864514'

Test #27:

score: 0

Accepted

time: 17ms

memory: 3668kb

input:

27 7 165249

output:

result:

ok single line: '29765'

Test #28:

score: 0

Accepted

time: 41ms

memory: 3636kb

input:

15 2 751665

output:

result:

ok single line: '429522'

Test #29:

score: 0

Accepted

time: 52ms

memory: 3580kb

input:

2 16 818146

output:

result:

ok single line: '460207'

Test #30:

score: 0

Accepted

time: 301ms

memory: 3576kb

input:

43 88 631366

output:

result:

ok single line: '21860'

Test #31:

score: 0

Accepted

time: 18ms

memory: 3696kb

input:

215 1222 3597

output:

result:

ok single line: '18'

Test #32:

score: -100

Time Limit Exceeded

input:

9619 3375 604892