QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#332368#8239. Mysterious TreeA1922WA 1ms3664kbC++142.8kb2024-02-19 14:55:232024-02-19 14:55:23

Judging History

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

  • [2024-02-19 14:55:23]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3664kb
  • [2024-02-19 14:55:23]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
int y[100005][4],f[100005][4];
using namespace std;
signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int j,f=0;
        int an;
        int n;
        cin>>n;
        for(int i=1; i<=n; i+=2)
        {
            j=i+1;
            cout<<"?"<<' '<<i<<' '<<j<<endl;
            cout.flush();
            cin>>an;
            if(an==1)
            {
                f=1;
                break;
            }
        }
        if(f==1)
        {
            if(j>3)
            {
                cout<<'?'<<' '<<j<<' '<<j-2<<endl;
                cout.flush();
                cin>>an;
                if(an==1)
                {
                    cout<<'?'<<' '<<j<<' '<<j-3<<endl;
                    cout.flush();
                    cin>>an;
                    if(an==1)f=1;
                    else f=0;
                }
                else
                {
                    cout<<'?'<<' '<<j-1<<' '<<j-2<<endl;
                    cout.flush();
                    cin>>an;
                    if(an==1)
                    {
                        cout<<'?'<<' '<<j-1<<' '<<j-3<<endl;
                        cout.flush();
                        cin>>an;
                        if(an==1)f=1;
                        else f=0;
                    }
                    else f=0;
                }
            }
            else
            {
                cout<<'?'<<' '<<j<<' '<<j+2<<endl;
                cout.flush();
                cin>>an;
                if(an==1)
                {
                    cout<<'?'<<' '<<j<<' '<<j+1<<endl;
                    cout.flush();
                    cin>>an;
                    if(an==1)f=1;
                    else f=0;
                }
                else
                {
                    cout<<'?'<<' '<<j-1<<' '<<j+2<<endl;
                    cout.flush();
                    cin>>an;
                    if(an==1)
                    {
                        cout<<'?'<<' '<<j-1<<' '<<j+1<<endl;
                        cout.flush();
                        cin>>an;
                        if(an==1)f=1;
                        else f=0;
                    }
                    else f=0;
                }
            }

        }
        else if(n%2==1)
        {
            cout<<'?'<<' '<<n<<' '<<n-1<<endl;
            cout.flush();
            cin>>an;
            if(an==1)
            {
                cout<<'?'<<' '<<n<<' '<<n-2<<endl;
                cout.flush();
                cin>>an;
                if(an==1)f=1;
                else f=0;
            }
            else f=0;
        }
        if(f==1)cout<<'!'<<' '<<'2'<<endl;
        else cout<<'!'<<' '<<'1'<<endl;
        cout.flush();

    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3664kb

input:

2
4
1
0
0
4
0
1
0
1
1

output:

? 1 2
? 2 4
? 1 4
! 1
? 1 2
? 3 4
? 4 2
? 3 2
? 3 1
! 2

result:

ok Correct (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3548kb

input:

87
13
0
0
0
0
0
1
1
1
15
0
0
0
0
0
0
1
0
1
1
7
0
0
0

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 12 10
? 12 9
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 14 12
? 13 12
? 13 11
! 2
? 1 2
? 3 4
? 5 6
? 7 8

result:

wrong answer Integer 8 violates the range [1, 7] (test case 3)