QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#162492#7102. Live Lovenotpasscet_6#AC ✓2ms3672kbC++14752b2023-09-03 13:32:142023-09-03 13:32:15

Judging History

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

  • [2023-09-03 13:32:15]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3672kb
  • [2023-09-03 13:32:14]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define x first
#define y second

typedef unsigned long long ull;
typedef pair<int,int> PII;

const int N=1e6+10;

int n,m;
int a[N],b[N];
int ans;

bool check(int x){
    int one=m;
    int zero=n-m;
    while(1){
        if((one-=x)<=0) return true;
        if(--zero<0) return false;
    }
}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    int T_T=1;
    cin>>T_T;
    while(T_T--){
        cin>>n>>m;
        cout<<m<<" ";
        int l=0,r=m;
        while(l<r){
            int mid=l+r>>1;
            if(check(mid)) r=mid;
            else l=mid+1;
        }
        cout<<l<<"\n";
    }
    return 0;
}


这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3672kb

input:

5
5 4
100 50
252 52
3 0
10 10

output:

4 2
50 1
52 1
0 0
10 10

result:

ok 5 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3624kb

input:

100
13 3
384 171
94 36
581 70
782 715
651 287
810 789
353 314
2 2
65 47
684 194
242 213
135 42
695 484
512 195
14 0
721 253
665 257
381 78
456 220
1000 500
1000 501
31 31
703 484
137 1
271 55
666 366
966 316
457 248
166 38
716 679
972 258
627 91
380 1
451 436
605 173
987 780
457 180
2 0
718 574
119 ...

output:

3 1
171 1
36 1
70 1
715 11
287 1
789 36
314 8
2 2
47 3
194 1
213 8
42 1
484 3
195 1
0 0
253 1
257 1
78 1
220 1
500 1
501 2
31 31
484 3
1 1
55 1
366 2
316 1
248 2
38 1
679 18
258 1
91 1
1 1
436 28
173 1
780 4
180 1
0 0
574 4
8 1
118 1
126 1
12 2
34 1
381 21
658 4
288 4
161 1
76 1
195 1
646 6
27 1
9 2...

result:

ok 100 lines

Extra Test:

score: 0
Extra Test Passed