QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#597913	#8056. Travel 2	Rosmontispes	AC ✓	210ms	5064kb	C++20	1.3kb	2024-09-28 19:26:11	2024-09-28 19:26:11

Judging History

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

[2024-09-28 19:26:11]
评测

测评结果：AC
用时：210ms
内存：5064kb

查看

[2024-09-28 19:26:11]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 2500 + 200;
void solve(){
    vector<int>cur(N,0),m(N,0),pa(N,0);
    map<int,int>M[N];
    vector<int>ans;
    auto ask = [&](int x)->int
    {
        int ret,mret;
        cout<<"> "<<x<<endl;
        cin>>ret>>mret;
        m[ret] = mret;
        return ret;
    };
    int x,mx,st;
    cin>>x>>mx;
    st = x;
    m[x] = mx;
    pa[x] = -1;
    while(x != st || cur[x] < m[x])
    {
        if(cur[x] < m[x]){
            int nex = ask(++ cur[x]);
            M[x][nex] = cur[x];
            if(x < nex)
                ans.push_back(x),ans.push_back(nex);
            if(pa[x] != -1 && nex == pa[x]){
                ask(M[pa[x]][x]);
                continue;
            }
            if(pa[nex] == 0)
                pa[nex] = x;
            x = nex;
        } else {
            ask(M[x][pa[x]]);
            x = pa[x];
        }
    };
    cout<<"! ";
    for(int i = 0;i < (int)ans.size();i ++){
        if(i < (int)ans.size() - 1)
            cout<<ans[i]<<" ";
        else
            cout<<ans[i]<<endl;
    }
    string ret;
    cin>>ret;
}
int main(){
    // std::ios::sync_with_stdio(false);
    // std::cin.tie(nullptr);
    int T;
    cin>>T;
    while(T --)
        solve();
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3760kb

input:

output:

> 1
> 1
> 1
> 1
! 1 2
> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 1
> 3
> 2
> 2
> 2
> 1
! 1 2 2 4 1 3 1 4

result:

ok correct! (2 test cases)

Test #2:

score: 0

Accepted

time: 210ms

memory: 3732kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 2
> 2
> 3
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 3
> 1
> 6
> 2
> 3
> 3
> 2
> 2
> 3
> 2
> 3
> 3
> 4
> 1
> 7
> 5
> 4
> 3
> 2
> 3
> 3
> 4
> 4
> 3
> 4
> 4
> 5
> 4
> 5
> 4
> 2
> 5
> 6
> 5
> 6
> 6
> 6
> 7
> 7
> 6
> 8
> 5
> 9
> 7
> 4
> 5
> 7
> 6
> 5
> 4
> 6
> 7
> 8
...

result:

ok correct! (1000 test cases)

Test #3:

score: 0

Accepted

time: 161ms

memory: 3768kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 3
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 3
> 3
> 2
> 2
> 3
> 4
> 2
> 3
> 3
> 1
> 6
> 2
> 2
> 3
> 1
> 7
> 2
> 3
> 3
> 1
> 8
> 1
> 8
> 2
> 3
> 1
> 9
> 1
> 9
> 2
> 4
> 3
> 4
> 1
> 10
> 4
> 2
> 1
> 11
> 2
> 3
> 3
> 3
> 5
> 4
> 4
> 5
> 6
> 5
> ...

result:

ok correct! (500 test cases)

Test #4:

score: 0

Accepted

time: 168ms

memory: 3812kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 2
> 2
> 3
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> 1
> 15
> 1
> ...

result:

ok correct! (100 test cases)

Test #5:

score: 0

Accepted

time: 205ms

memory: 4176kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 1
> 11
> 2
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> 1
> 15
> 1
>...

result:

ok correct! (10 test cases)

Test #6:

score: 0

Accepted

time: 165ms

memory: 5064kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 1
> 11
> 2
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> 1
> 15
> 1
> 15
> 2
...

result:

ok correct! (4 test cases)

Test #7:

score: 0

Accepted

time: 123ms

memory: 4776kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 3
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 3
> 3
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 1
> 11
> 2
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> ...

result:

ok correct! (4 test cases)

Test #8:

score: 0

Accepted

time: 114ms

memory: 4424kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 2
> 2
> 3
> 1
> 3
> 2
> 3
> 3
> 3
> 4
> 1
> 4
> 2
> 4
> 3
> 4
> 4
> 4
> 5
> 1
> 5
> 2
> 5
> 3
> 5
> 4
> 5
> 5
> 5
> 6
> 1
> 6
> 2
> 6
> 3
> 6
> 4
> 6
> 5
> 6
> 6
> 6
> 7
> 1
> 7
> 2
> 7
> 3
> 7
> 4
> 7
> 5
> 7
> 6
> 7
> 7
> 7
> 8
> 1
> 8
> 2
> 8
> 3
> 8
> 4
> 8
> 5
> 8
> 6
...

result:

ok correct! (4 test cases)

Test #9:

score: 0

Accepted

time: 53ms

memory: 4216kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 2
> 1
> 2
> 2
> 2
> 2
> 3
> 1
> 3
> 2
> 3
> 2
> 4
> 1
> 4
> 2
> 4
> 2
> 5
> 1
> 5
> 2
> 5
> 2
> 6
> 1
> 6
> 2
> 6
> 2
> 7
> 1
> 7
> 2
> 7
> 2
> 8
> 1
> 8
> 2
> 8
> 2
> 9
> 1
> 9
> 2
> 9
> 2
> 10
> 1
> 10
> 2
> 10
> 2
> 11
> 1
> 11
> 2
> 11
> 2
> 12
> 1
> 12
> 2
> 12
> 2
> 1...

result:

ok correct! (4 test cases)

Extra Test:

score: 0

Extra Test Passed