QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#458928	#8831. Chemistry Class	ucup-team3924^#	WA	63ms	9408kb	C++20	2.0kb	2024-06-29 20:44:27	2024-06-29 20:44:27

Judging History

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

[2024-06-29 20:44:27]
评测

测评结果：WA
用时：63ms
内存：9408kb

查看

[2024-06-29 20:44:27]
提交

answer

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

struct node{
    int l, r;
    int diff(){
        return abs(r - l);
    }
    void print(){
        cout << l << " " << r << endl;
    }
};

void solve(){
    int N, MIN, MAX;
    cin >> N >> MAX >> MIN;
    vector<int> arr(2 * N);
    vector<node> pairs(N);
    for(int i = 0; i < 2 * N; i ++){
        cin >> arr[i];
    }
    sort(arr.begin(), arr.end());
    int diff = 0;
    for(int i = 0; i < 2 * N; i += 2){
        pairs[i / 2] = {arr[i], arr[i + 1]};
        diff = max(diff, pairs[i/2].diff());
    }
    if(diff > MAX){
        cout << -1 << endl;
    }
    else{
        int c = 0;
        bool lt = false;
        for(int i = 0; i < N; i ++){
            if(lt && pairs[i].diff() <= MIN){
                swap(pairs[i - 1].l, pairs[i].l);
                if(pairs[i].diff() <= MAX){
                    if(pairs[i-1].diff() <= MIN){
                        c ++;
                    }
                    else{
                        swap(pairs[i - 1].l, pairs[i].l);
                    } 
                }
                else{
                    swap(pairs[i - 1].l, pairs[i].l);
                }
            }
            else if(pairs[i].diff() <= MIN){
                c ++;
                lt = false;
            }
            else if(lt){
                swap(pairs[i - 1].l, pairs[i].l);
                if(pairs[i].diff() <= MAX){
                    if(pairs[i-1].diff() <= MIN){
                        c ++;
                    }
                    else{
                        swap(pairs[i - 1].l, pairs[i].l);
                    } 
                }
                else{
                    swap(pairs[i - 1].l, pairs[i].l);
                }
            }
            else{
                lt = true;
            }
        }
        cout << c << endl;
    }
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int N;
    cin >> N;
    while(N --){
        solve();
    }
    return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3672kb

input:

4
1 2 1
42 69
2 3 1
1 2 3 4
2 5 1
6 1 3 4
5 19 1
1 7 8 9 10 11 12 13 14 20

output:

result:

ok 4 number(s): "-1 2 1 4"

Test #2:

score: 0

Accepted

time: 63ms

memory: 9336kb

input:

1
199996 67013419502794 1
403716252634677166 895717933735068492 410002430455111886 844431179242134559 322988383133810700 133475121268220299 481706326769800263 606871141911985391 195911124687409946 959578180866483093 930547702157856949 877914383714875160 994158366044742636 890855755285236186 69498488...

output:

result:

ok 1 number(s): "0"

Test #3:

score: 0

Accepted

time: 62ms

memory: 9344kb

input:

1
199998 38987266278826 1
974183459404323858 517476981059568123 730207399881008603 532509909948600146 89227878552241675 16653300445469756 791674368913652595 92177901403222015 980536748304824579 581564387828767376 471919726893404451 759601909683722004 632340812998214017 818440789777778368 18845836031...

output:

result:

ok 1 number(s): "0"

Test #4:

score: 0

Accepted

time: 59ms

memory: 9408kb

input:

1
199996 54170919220045 1
968843690955781467 596307347951820347 406785475849275444 383666938223357986 725160735782817082 132577412512120631 891899794864087098 779434145671998619 932681297277907326 208765550447928461 385078857912267975 669360937040314510 917331948890514855 505938744714587815 47145437...

output:

result:

ok 1 number(s): "0"

Test #5:

score: -100

Wrong Answer

time: 62ms

memory: 9344kb

input:

1
199998 35667463938291 8255384928693
770468016026697053 519790816750772730 110085058423772871 85144239858008037 782003096084947976 938498644167289660 693768718229582367 242186248813489674 155335549252315364 428982852761422230 890445026369869037 86401573937739054 9122788624365829 63351367715811463 1...

output:

result:

wrong answer 1st numbers differ - expected: '193326', found: '170034'