QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#677958	#8239. Mysterious Tree	tsogsummit^#	AC ✓	7ms	3952kb	C++14	2.6kb	2024-10-26 13:44:49	2024-10-26 13:44:49

Judging History

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

[2024-10-26 13:44:49]
评测

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

查看

[2024-10-26 13:44:49]
提交

answer

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

int main() {
	int t, n, i, x, y, z, a, b, s, c, d;
    scanf("%d",&t);
	while(t--) {
		scanf("%d",&n);
        a=b=0;
        s=0;
        for(i=1; i<n; i+=2){
            printf("? %d %d\n", i, i+1);
            cout.flush();
            scanf("%d",&x);
            if(x==1){
                s++;
                a=i;
                b=i+1;
            }
        }
        if(n%2==1){
            printf("? %d %d\n", n-1, n);
            cout.flush();
            scanf("%d",&x);
            if(x==1){
                s++;
                a=n-1;
                b=n;
            }
        }
        if(s==0){
            printf("! 1\n");
            cout.flush();
            continue;
        }
        if(s>1){
            printf("? %d %d\n", n-2, n-1);
            cout.flush();
            scanf("%d",&y);
            printf("? %d %d\n", n-3, n-1);
            cout.flush();
            scanf("%d",&z);
            if(s==2 && x==1 && y==1 && z==1 && n%2==1){
                printf("! 2\n");
                cout.flush();
            }
            else{
                printf("! 1\n");
                cout.flush();
            }
            continue;
        }
        if(a==1) c=n;
        else c=a-1;
        printf("? %d %d\n", c, a);
        cout.flush();
        scanf("%d",&x);

        if(b==n) d=1;
        else d=b+1;
        printf("? %d %d\n", d, b);
        cout.flush();
        scanf("%d",&y);
        if(x==0 && y==0){
            printf("! 1\n");
            cout.flush();
            continue;
        }
        if(x==1 && y==1){
            printf("! 1\n");
            cout.flush();
            continue;
        }
        if(x==1){
            if(a-2<=0) c=a-2+n;
            else c=a-2;
            printf("? %d %d\n", c, a);
            cout.flush();
            scanf("%d",&x);
            if(x==1){
                printf("! 2\n");
                cout.flush();
                continue;
            }
            else{
                printf("! 1\n");
                cout.flush();
                continue;
            }
        }
        else{
            if(b+2>n) d=b+2-n;
            else d=b+2;
            printf("? %d %d\n", d, b);
            cout.flush();
            scanf("%d",&x);
            if(x==1){
                printf("! 2\n");
                cout.flush();
                continue;
            }
            else{
                printf("! 1\n");
                cout.flush();
                continue;
            }
        }
	}
}

Source code, Language: C++14

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3748kb

input:

output:

result:

ok Correct (2 test cases)

Test #2:

score: 0

Accepted

time: 3ms

memory: 3740kb

input:

output:

result:

ok Correct (87 test cases)

Test #3:

score: 0

Accepted

time: 4ms

memory: 3860kb

input:

output:

result:

ok Correct (135 test cases)

Test #4:

score: 0

Accepted

time: 6ms

memory: 3796kb

input:

output:

result:

ok Correct (136 test cases)

Test #5:

score: 0

Accepted

time: 0ms

memory: 3940kb

input:

output:

result:

ok Correct (5 test cases)

Test #6:

score: 0

Accepted

time: 3ms

memory: 3784kb

input:

output:

result:

ok Correct (7 test cases)

Test #7:

score: 0

Accepted

time: 6ms

memory: 3800kb

input:

output:

result:

ok Correct (160 test cases)

Test #8:

score: 0

Accepted

time: 7ms

memory: 3892kb

input:

output:

result:

ok Correct (117 test cases)

Test #9:

score: 0

Accepted

time: 0ms

memory: 3952kb

input:

output:

result:

ok Correct (99 test cases)

Test #10:

score: 0

Accepted

time: 0ms

memory: 3848kb

input:

output:

result:

ok Correct (84 test cases)

Test #11:

score: 0

Accepted

time: 0ms

memory: 3860kb

input:

output:

result:

ok Correct (23 test cases)

Test #12:

score: 0

Accepted

time: 0ms

memory: 3792kb

input:

output:

result:

ok Correct (20 test cases)

Test #13:

score: 0

Accepted

time: 3ms

memory: 3720kb

input:

output:

result:

ok Correct (9 test cases)

Test #14:

score: 0

Accepted

time: 3ms

memory: 3788kb

input:

output:

result:

ok Correct (6 test cases)

Test #15:

score: 0

Accepted

time: 0ms

memory: 3792kb

input:

output:

result:

ok Correct (4 test cases)

Test #16:

score: 0

Accepted

time: 7ms

memory: 3864kb

input:

output:

result:

ok Correct (146 test cases)

Test #17:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

result:

ok Correct (117 test cases)

Test #18:

score: 0

Accepted

time: 0ms

memory: 3800kb

input:

output:

result:

ok Correct (105 test cases)

Test #19:

score: 0

Accepted

time: 4ms

memory: 3796kb

input:

output:

result:

ok Correct (86 test cases)

Test #20:

score: 0

Accepted

time: 1ms

memory: 3940kb

input:

output:

result:

ok Correct (20 test cases)

Test #21:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

result:

ok Correct (9 test cases)

Test #22:

score: 0

Accepted

time: 1ms

memory: 3740kb

input:

output:

result:

ok Correct (12 test cases)

Test #23:

score: 0

Accepted

time: 3ms

memory: 3852kb

input:

output:

result:

ok Correct (5 test cases)

Test #24:

score: 0

Accepted

time: 2ms

memory: 3740kb

input:

output:

result:

ok Correct (81 test cases)

Test #25:

score: 0

Accepted

time: 0ms

memory: 3780kb

input:

output:

result:

ok Correct (24 test cases)

Test #26:

score: 0

Accepted

time: 5ms

memory: 3784kb

input:

output:

result:

ok Correct (9 test cases)

Test #27:

score: 0

Accepted

time: 2ms

memory: 3788kb

input:

output:

result:

ok Correct (8 test cases)

Test #28:

score: 0

Accepted

time: 2ms

memory: 3940kb

input:

output:

result:

ok Correct (10 test cases)

Test #29:

score: 0

Accepted

time: 1ms

memory: 3784kb

input:

output:

result:

ok Correct (1 test case)

Test #30:

score: 0

Accepted

time: 2ms

memory: 3780kb

input:

output:

result:

ok Correct (2 test cases)

Test #31:

score: 0

Accepted

time: 0ms

memory: 3856kb

input:

output:

result:

ok Correct (4 test cases)

Test #32:

score: 0

Accepted

time: 2ms

memory: 3940kb

input:

output:

result:

ok Correct (1 test case)

Test #33:

score: 0

Accepted

time: 3ms

memory: 3792kb

input:

output:

result:

ok Correct (1 test case)

Test #34:

score: 0

Accepted

time: 4ms

memory: 3892kb

input:

output:

result:

ok Correct (1 test case)

Test #35:

score: 0

Accepted

time: 3ms

memory: 3944kb

input:

output:

result:

ok Correct (2 test cases)

Test #36:

score: 0

Accepted

time: 0ms

memory: 3772kb

input:

output:

result:

ok Correct (2 test cases)

Test #37:

score: 0

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok Correct (2 test cases)

Test #38:

score: 0

Accepted

time: 0ms

memory: 3864kb

input:

output:

result:

ok Correct (4 test cases)

Test #39:

score: 0

Accepted

time: 3ms

memory: 3868kb

input:

output:

result:

ok Correct (4 test cases)

Test #40:

score: 0

Accepted

time: 0ms

memory: 3892kb

input:

output:

result:

ok Correct (4 test cases)

Test #41:

score: 0

Accepted

time: 3ms

memory: 3804kb

input:

output:

result:

ok Correct (1 test case)

Extra Test:

score: 0

Extra Test Passed