QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#693263	#8239. Mysterious Tree	wang_xy^#	AC ✓	5ms	3952kb	C++20	2.8kb	2024-10-31 15:50:53	2024-10-31 15:50:53

Judging History

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

[2024-10-31 15:50:53]
评测

测评结果：AC
用时：5ms
内存：3952kb

查看

[2024-10-31 15:50:53]
提交

answer

#include <bits/stdc++.h>
#define int int
#define ll int
#define ff fflush(stdout)
using namespace std;
int query(int x,int y){
    printf("? %d %d\n",x,y);
    ff;
    scanf("%d",&x);
    return x;
}
void print(int x){
    printf("! %d\n",x);
    ff;
}
void solve() {
    ll n;
    cin>>n;
    ll cnt=0;
    ll a,b;
    if(n%2==1){
        for(ll i=1;i<n;i+=2){
            ll x=query(i,i+1);
            if(x==1){
                cnt++;
                a=i,b=i+1;
            }
        }
        if(cnt>1){
            print(1);
        }
        else if(cnt==0){
            ll x=query(n-1,n);
            ll y=query(n-2,n);
            ll z=query(n-3,n);
            if(x+y+z!=3)
                print(1);
            else
                print(2);
        }
        else{
            ll A,B;
            for(ll i=1;i<n;i+=2){
                if(i!=a){
                    A=i,B=i+1;
                    break;
                }
            }
            ll x=query(A,a);
            if(x==1){
                x=query(B,a);
                if(x==1){
                    print(2);
                }
                else{
                    print(1);
                }
            }
            else{
                x=query(A,b);
                if(x==1){
                    x=query(B,b);
                    if(x==1){
                        print(2);
                    }
                    else{
                        print(1);
                    }
                }
                else{
                    print(1);
                }
            }
        }
    }
    else{
        for(ll i=2;i<=n;i+=2){
            ll x=query(i-1,i);
            if(x==1){
                cnt++;
                a=i-1,b=i;
            }
        }
        if(cnt!=1){
            print(1);
        }
        else{
            ll A,B;
            for(ll i=1;i<n;i+=2){
                if(i!=a){
                    A=i,B=i+1;
                    break;
                }
            }
            ll x=query(A,a);
            if(x==1){
                x=query(B,a);
                if(x==1){
                    print(2);
                }
                else{
                    print(1);
                }
            }
            else{
                x=query(A,b);
                if(x==1){
                    x=query(B,b);
                    if(x==1){
                        print(2);
                    }
                    else{
                        print(1);
                    }
                }
                else{
                    print(1);
                }
            }
        }
    }
}

signed main() {
//    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    ll t;
    cin>>t;
    while (t--)
        solve();
    return 0;
}

Source code, Language: C++20

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3816kb

input:

output:

result:

ok Correct (2 test cases)

Test #2:

score: 0

Accepted

time: 2ms

memory: 3824kb

input:

output:

result:

ok Correct (87 test cases)

Test #3:

score: 0

Accepted

time: 2ms

memory: 3896kb

input:

output:

result:

ok Correct (135 test cases)

Test #4:

score: 0

Accepted

time: 5ms

memory: 3952kb

input:

output:

result:

ok Correct (136 test cases)

Test #5:

score: 0

Accepted

time: 3ms

memory: 3804kb

input:

output:

result:

ok Correct (5 test cases)

Test #6:

score: 0

Accepted

time: 0ms

memory: 3900kb

input:

output:

result:

ok Correct (7 test cases)

Test #7:

score: 0

Accepted

time: 4ms

memory: 3804kb

input:

output:

result:

ok Correct (160 test cases)

Test #8:

score: 0

Accepted

time: 0ms

memory: 3944kb

input:

output:

result:

ok Correct (117 test cases)

Test #9:

score: 0

Accepted

time: 2ms

memory: 3836kb

input:

output:

result:

ok Correct (99 test cases)

Test #10:

score: 0

Accepted

time: 4ms

memory: 3880kb

input:

output:

result:

ok Correct (84 test cases)

Test #11:

score: 0

Accepted

time: 2ms

memory: 3884kb

input:

output:

result:

ok Correct (23 test cases)

Test #12:

score: 0

Accepted

time: 4ms

memory: 3804kb

input:

output:

result:

ok Correct (20 test cases)

Test #13:

score: 0

Accepted

time: 4ms

memory: 3896kb

input:

output:

result:

ok Correct (9 test cases)

Test #14:

score: 0

Accepted

time: 4ms

memory: 3800kb

input:

output:

result:

ok Correct (6 test cases)

Test #15:

score: 0

Accepted

time: 3ms

memory: 3944kb

input:

output:

result:

ok Correct (4 test cases)

Test #16:

score: 0

Accepted

time: 2ms

memory: 3896kb

input:

output:

result:

ok Correct (146 test cases)

Test #17:

score: 0

Accepted

time: 4ms

memory: 3888kb

input:

output:

result:

ok Correct (117 test cases)

Test #18:

score: 0

Accepted

time: 0ms

memory: 3892kb

input:

output:

result:

ok Correct (105 test cases)

Test #19:

score: 0

Accepted

time: 3ms

memory: 3888kb

input:

output:

result:

ok Correct (86 test cases)

Test #20:

score: 0

Accepted

time: 0ms

memory: 3844kb

input:

output:

result:

ok Correct (20 test cases)

Test #21:

score: 0

Accepted

time: 0ms

memory: 3944kb

input:

output:

result:

ok Correct (9 test cases)

Test #22:

score: 0

Accepted

time: 0ms

memory: 3844kb

input:

output:

result:

ok Correct (12 test cases)

Test #23:

score: 0

Accepted

time: 3ms

memory: 3896kb

input:

output:

result:

ok Correct (5 test cases)

Test #24:

score: 0

Accepted

time: 5ms

memory: 3884kb

input:

output:

result:

ok Correct (81 test cases)

Test #25:

score: 0

Accepted

time: 0ms

memory: 3900kb

input:

output:

result:

ok Correct (24 test cases)

Test #26:

score: 0

Accepted

time: 0ms

memory: 3876kb

input:

output:

result:

ok Correct (9 test cases)

Test #27:

score: 0

Accepted

time: 2ms

memory: 3884kb

input:

output:

result:

ok Correct (8 test cases)

Test #28:

score: 0

Accepted

time: 4ms

memory: 3920kb

input:

output:

result:

ok Correct (10 test cases)

Test #29:

score: 0

Accepted

time: 3ms

memory: 3820kb

input:

output:

result:

ok Correct (1 test case)

Test #30:

score: 0

Accepted

time: 2ms

memory: 3892kb

input:

output:

result:

ok Correct (2 test cases)

Test #31:

score: 0

Accepted

time: 3ms

memory: 3884kb

input:

output:

result:

ok Correct (4 test cases)

Test #32:

score: 0

Accepted

time: 2ms

memory: 3892kb

input:

output:

result:

ok Correct (1 test case)

Test #33:

score: 0

Accepted

time: 0ms

memory: 3816kb

input:

output:

result:

ok Correct (1 test case)

Test #34:

score: 0

Accepted

time: 1ms

memory: 3840kb

input:

output:

result:

ok Correct (1 test case)

Test #35:

score: 0

Accepted

time: 3ms

memory: 3896kb

input:

output:

result:

ok Correct (2 test cases)

Test #36:

score: 0

Accepted

time: 1ms

memory: 3880kb

input:

output:

result:

ok Correct (2 test cases)

Test #37:

score: 0

Accepted

time: 3ms

memory: 3764kb

input:

output:

result:

ok Correct (2 test cases)

Test #38:

score: 0

Accepted

time: 2ms

memory: 3816kb

input:

output:

result:

ok Correct (4 test cases)

Test #39:

score: 0

Accepted

time: 2ms

memory: 3900kb

input:

output:

result:

ok Correct (4 test cases)

Test #40:

score: 0

Accepted

time: 2ms

memory: 3944kb

input:

output:

result:

ok Correct (4 test cases)

Test #41:

score: 0

Accepted

time: 3ms

memory: 3764kb

input:

output:

result:

ok Correct (1 test case)

Extra Test:

score: 0

Extra Test Passed