QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#784435#8220. 众生之门sea_and_sky40 480ms92724kbC++145.0kb2024-11-26 15:00:092024-11-26 15:00:11

Judging History

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

  • [2024-11-26 15:00:11]
  • 评测
  • 测评结果：40
  • 用时：480ms
  • 内存：92724kb
查看
  • [2024-11-26 15:00:09]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
mt19937 eng;
#define ll long long
const int inf = 998244353;

int dfn;
struct node
{
    int fa;
    int deep;
    int dfn;
    vector<int> son;
    int top;
    void clear()
    {
        this->deep = 0;
        this->dfn = 0;
        this->top = 0;
        this->fa = 0;
        this->son.clear();
    }
};
int st[20][1001000];
node tr[1000100];
int t;
int S, T;
int n;
int rnd(int l, int r)
{
    return l + (eng() % (r - l + 1));
}
int dfnmin(int x, int y)
{
    return tr[x].dfn < tr[y].dfn ? x : y;
}
void build(int x)
{
    tr[x].dfn = ++dfn;
    tr[x].deep = tr[tr[x].fa].deep + 1;

    st[0][tr[x].dfn] = tr[x].fa;
    for (int son : tr[x].son)
    {
        if (son != tr[x].fa)
        {
            tr[son].fa = x;
            build(son);
        }
    }
}
void init()
{
    for (int i = 1; i <= __lg(n); i++)
    {
        for (int ww = 1; ww <= n; ww++)
        {
            st[i][ww] = dfnmin(st[i - 1][ww], st[i - 1][ww + (1 << (i - 1))]);
        }
    }
}
int get_lca(int a, int b)
{
    if (a == b)
    {
        return a;
    }
    int u = tr[a].dfn, v = tr[b].dfn;
    if (u > v)
    {
        swap(u, v), swap(a, b);
    }
    int d = __lg(v - u);
    u++;
    int lca_ = dfnmin(st[d][u], st[d][v - (1 << d) + 1]);
    return tr[a].deep + tr[b].deep - (tr[lca_].deep * 2);
}
int ans_ = inf;
int p[1000000];
int had_u[1000000];
int check()
{
    int insid = 0;
    for (int ww = 2; ww <= n; ww++)
    {
        insid ^= get_lca(p[ww - 1], p[ww]);
    }
    return insid;
}
void dfs(int x)
{
    if (x == n - 1)
    {
        ans_ = min(ans_, check());
    }
    else
    {
        x++;
        for (int ww = 1; ww <= n; ww++)
        {
            if (had_u[ww] == 0)
            {
                p[x] = ww;
                had_u[ww] = 1;
                dfs(x);
                p[x] = 0;
                had_u[ww] = 0;
            }
        }
    }
}
bool con_tag = 1;
void dfs_ans(int x)
{
    if (x == n - 1)
    {
        if (ans_ == check())
        {
            for (int ww = 1; ww <= n; ww++)
            {
                cout << p[ww] << " ";
            }
            cout << endl;
            con_tag = 0;
        }
    }
    else
    {
        x++;
        for (int ww = 1; ww <= n; ww++)
        {
            while (con_tag == 0)
            {
                return;
            }
            if (had_u[ww] == 0)
            {
                p[x] = ww;
                had_u[ww] = 1;
                dfs_ans(x);
                p[x] = 0;
                had_u[ww] = 0;
            }
        }
    }
}
bool is_flower()
{
    for (int e = 1; e <= n; e++)
    {
        if (tr[e].son.size() == (n - 1) + (tr[e].fa ? 1 : 0))
        {
            return 1;
        }
    }
    return 0;
}

int main()
{
    // freopen("2.in","r",stdin);
    ios::sync_with_stdio(false);
    eng.seed(time(NULL));
    cin >> t;
    for (int ww = 1; ww <= t; ww++)
    {
        for (int i = 1; i <= n; i++)
        {
            tr[i].son.clear();
        }
        cin >> n >> S >> T;

        int a, b;
        for (int i = 1; i < n; i++)
        {
            cin >> a >> b;
            tr[a].son.emplace_back(b);
            tr[b].son.emplace_back(a);
        }
        // memset(st, 0, sizeof(st));
        dfn=0;
        build(1);
        init();

        if (n <= 10)
        {
            ans_ = inf;
            p[1] = S;
            p[n] = T;
            had_u[S] = 1;
            had_u[T] = 1;
            dfs(1);
            con_tag = 1;
            // cout<<ans_<<"-\n";
            dfs_ans(1);
            had_u[T] = 0;
            had_u[S] = 0;
        }
        else
        {
            p[1] = S, p[n] = T;

            for (int i = 1; i <= n; i++)
            {
                if (i != S && i != T)
                {
                    p[i - (i > S) - (i > T) + 1] = i;
                }
            }
            if (is_flower())
            {
                for (int ww = 1; ww <= n; ww++)
                {
                    cout << p[ww] << " ";
                }
                cout << "\n";
                continue;
            }
            int now_ = check();
            while (now_ > 1)
            {
                int a_ = rnd(2, n - 1), b_ = rnd(2, n - 1);
                while (a_ == b_)
                {
                    b_ = rnd(2, n - 1);
                }
                int rec_ = now_;
                now_ ^= get_lca(p[a_ - 1], p[a_]) ^ get_lca(p[a_], p[a_ + 1]) ^ get_lca(p[b_ - 1], p[b_]) ^ get_lca(p[b_], p[b_ + 1]);
                swap(p[a_], p[b_]);
                now_ ^= get_lca(p[a_ - 1], p[a_]) ^ get_lca(p[a_], p[a_ + 1]) ^ get_lca(p[b_ - 1], p[b_]) ^ get_lca(p[b_], p[b_ + 1]);

            }
            for (int ww = 1; ww <= n; ww++)
            {
                cout << p[ww] << " ";
            }
            cout << "\n";
        }
    }
    return 0;
}
源文件, 语言: C++14

詳細信息

Subtask #1:

score: 5
Accepted

Test #1:

score: 5
Accepted
time: 4ms
memory: 57024kb

input:

114
6 5 6
2 6
1 6
4 5
3 1
6 4
6 3 6
2 4
4 1
6 4
1 5
5 3
6 6 1
5 2
1 2
4 6
2 4
3 2
6 6 1
3 6
5 3
1 6
4 2
2 5
6 3 1
5 3
2 4
1 5
4 3
6 3
4 3 4
2 3
1 4
4 3
6 3 1
2 3
6 3
4 3
1 6
5 1
5 3 2
1 2
4 2
2 3
5 2
6 1 4
2 1
5 2
4 1
6 2
3 6
6 5 1
4 2
6 5
1 3
2 6
3 2
4 4 1
2 4
3 4
1 4
6 2 5
3 5
4 6
1 4
6 2
5 4
6 1 ...

output:

5 1 2 3 4 6 
3 1 2 4 5 6 
6 2 3 4 5 1 
6 2 5 4 3 1 
3 2 4 5 6 1 
3 1 2 4 
3 6 2 5 4 1 
3 1 4 5 2 
1 2 3 5 6 4 
5 2 3 4 6 1 
4 2 3 1 
2 1 3 4 6 5 
1 2 6 5 4 3 
3 4 5 2 6 1 
2 1 3 6 5 4 
3 1 2 5 6 4 
5 1 4 2 6 3 
1 3 2 4 5 
4 1 3 2 
3 1 2 5 4 
1 3 2 4 
3 4 1 2 
5 1 3 4 2 
5 2 4 3 1 
5 1 2 6 4 3 
4 2 6...

result:

ok Answer correct!

Test #2:

score: 5
Accepted
time: 5ms
memory: 59020kb

input:

157
7 3 7
1 3
4 5
6 5
2 5
5 1
7 2
7 7 6
5 6
3 6
2 6
6 7
1 7
4 3
7 6 1
7 4
4 6
2 3
1 2
3 6
5 1
6 1 5
2 5
6 2
5 1
3 2
4 2
5 3 1
1 3
5 3
2 5
4 5
7 4 2
1 5
2 6
6 3
5 4
7 5
3 1
7 1 5
6 1
2 6
5 1
7 6
3 1
4 6
7 5 7
6 5
4 7
7 6
2 3
3 7
1 4
7 6 7
4 7
5 4
7 1
3 6
2 1
1 3
6 5 1
2 4
6 5
4 6
3 2
1 5
7 1 5
2 6
6 ...

output:

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

result:

ok Answer correct!

Test #3:

score: 5
Accepted
time: 12ms
memory: 59024kb

input:

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

output:

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

result:

ok Answer correct!

Test #4:

score: 5
Accepted
time: 4ms
memory: 61064kb

input:

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

output:

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

result:

ok Answer correct!

Test #5:

score: 5
Accepted
time: 10ms
memory: 61192kb

input:

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

output:

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

result:

ok Answer correct!

Subtask #2:

score: 8
Accepted

Dependency #1:

100%
Accepted

Test #6:

score: 8
Accepted
time: 44ms
memory: 61144kb

input:

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

output:

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

result:

ok Answer correct!

Test #7:

score: 8
Accepted
time: 30ms
memory: 61124kb

input:

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

output:

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

result:

ok Answer correct!

Test #8:

score: 8
Accepted
time: 40ms
memory: 61068kb

input:

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

output:

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

result:

ok Answer correct!

Test #9:

score: 8
Accepted
time: 52ms
memory: 61124kb

input:

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

output:

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

result:

ok Answer correct!

Test #10:

score: 8
Accepted
time: 70ms
memory: 61000kb

input:

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

output:

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

result:

ok Answer correct!

Subtask #3:

score: 17
Accepted

Test #11:

score: 17
Accepted
time: 298ms
memory: 63148kb

input:

14190
43 27 2
42 3
30 36
11 24
21 22
13 8
22 30
31 29
35 1
10 6
2 23
28 17
2 26
7 37
5 19
38 43
33 39
4 28
33 7
25 31
15 1
32 18
34 27
35 12
19 32
20 17
37 42
26 34
39 10
12 27
24 43
18 6
16 9
38 9
14 15
14 41
25 3
40 13
16 8
36 41
20 5
21 40
11 29
41 24 38
21 6
20 14
26 1
6 7
17 16
39 36
8 18
36 11...

output:

27 9 30 4 1 6 41 8 39 10 11 43 13 14 31 16 17 18 19 20 21 34 23 24 25 26 28 29 3 15 32 33 36 35 40 37 38 5 22 7 42 12 2 
24 5 40 3 4 9 6 22 16 33 41 23 11 35 7 15 25 17 31 19 13 21 39 28 10 26 36 14 29 2 1 37 27 30 18 8 32 12 34 20 38 
5 18 15 6 20 1 8 27 25 3 23 26 21 4 7 16 11 2 17 19 14 10 13 24 ...

result:

ok Answer correct!

Test #12:

score: 17
Accepted
time: 113ms
memory: 65108kb

input:

9236
52 51 21
5 3
51 16
20 49
5 34
46 33
28 34
10 23
14 45
51 9
44 11
52 6
15 37
44 14
24 35
50 2
41 27
21 47
17 4
12 43
22 26
41 39
18 45
40 50
33 1
29 21
19 35
19 49
22 43
36 16
39 11
17 42
30 25
27 30
37 46
47 38
23 48
7 12
9 13
10 26
28 25
8 52
32 29
6 13
36 32
2 31
15 18
8 1
4 38
48 24
42 40
7 ...

output:

51 25 3 50 39 5 17 31 27 20 28 46 37 42 52 15 43 26 48 35 41 22 12 13 38 40 32 49 14 16 23 34 33 1 6 11 44 29 10 47 8 19 18 30 7 36 45 24 9 2 4 21 
49 20 2 38 46 47 10 42 41 43 27 11 24 4 6 23 12 40 18 33 9 44 1 34 17 29 13 35 22 50 51 5 16 21 15 19 45 28 8 30 37 48 26 31 25 3 7 36 39 14 32 
30 10 2...

result:

ok Answer correct!

Test #13:

score: 17
Accepted
time: 87ms
memory: 65224kb

input:

7430
56 55 12
1 32
29 36
45 8
33 47
29 56
36 13
3 24
5 11
55 39
4 34
46 34
37 23
35 53
56 54
7 44
1 27
12 20
28 54
25 19
51 6
42 38
15 30
37 25
38 3
16 39
12 52
41 9
50 53
22 26
11 13
18 55
33 15
27 6
47 28
43 14
23 22
21 9
48 49
4 2
14 31
10 52
5 18
20 40
2 42
17 31
51 49
48 21
16 43
41 44
50 46
40...

output:

55 1 2 27 4 5 6 14 42 23 10 11 13 49 15 18 17 16 19 20 21 29 9 24 25 26 3 28 22 50 31 32 33 34 35 36 37 30 39 40 41 43 8 44 45 46 47 48 7 38 51 52 53 54 56 12 
24 2 9 17 32 22 7 48 3 15 10 12 13 14 50 46 8 18 25 55 40 29 38 19 26 20 28 6 16 31 27 37 34 35 5 33 51 36 21 41 4 43 44 45 30 47 11 42 49 5...

result:

ok Answer correct!

Test #14:

score: 17
Accepted
time: 480ms
memory: 65288kb

input:

9765
42 15 16
22 4
6 9
42 6
25 20
22 24
9 39
2 13
36 11
5 21
11 18
7 34
4 35
42 10
16 10
29 30
29 8
17 30
12 40
34 39
27 15
27 3
17 31
2 19
12 14
41 23
15 16
36 1
28 38
13 40
38 33
41 24
8 37
37 18
7 35
26 5
28 20
33 31
1 26
32 14
32 21
23 19
18 3 16
11 6
16 9
11 13
8 4
17 7
18 15
8 9
14 13
17 4
16 ...

output:

15 31 40 41 19 20 22 36 12 2 11 13 27 18 23 5 34 25 17 1 38 10 24 6 9 35 28 29 21 8 3 37 26 4 32 33 7 30 14 39 42 16 
3 10 7 1 9 13 2 8 5 14 6 12 15 17 4 11 18 16 
9 13 11 12 17 5 18 4 15 3 1 14 8 10 6 19 7 2 16 
6 7 2 3 26 5 44 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 4 27 28 29 30 31 32 33...

result:

ok Answer correct!

Test #15:

score: 17
Accepted
time: 135ms
memory: 71276kb

input:

1969
144 119 17
109 11
66 80
131 133
76 89
128 137
80 77
141 114
98 94
55 68
115 41
31 78
104 123
106 138
18 37
72 100
38 14
15 86
87 136
41 99
26 56
130 84
67 1
28 96
92 88
12 137
11 102
13 42
48 93
79 43
51 98
100 130
131 59
38 52
24 117
7 19
93 135
135 29
35 101
46 62
47 39
99 85
122 87
123 70
11...

output:

119 27 2 3 4 5 50 7 109 99 100 11 12 118 14 15 37 18 19 114 49 36 23 41 25 26 1 101 29 107 80 88 66 34 35 131 73 39 67 127 122 85 116 44 45 46 47 48 13 56 51 20 53 54 55 6 28 58 90 60 61 62 115 64 65 33 32 68 69 70 71 9 82 74 83 76 108 97 79 31 137 124 75 84 42 86 87 22 89 59 91 92 93 94 95 96 21 72...

result:

ok Answer correct!

Test #16:

score: 17
Accepted
time: 122ms
memory: 75552kb

input:

500
844 123 801
629 492
828 294
203 630
621 178
604 159
4 26
750 486
123 709
100 83
66 161
682 411
547 837
812 104
8 394
402 547
312 607
396 823
320 564
251 504
640 315
295 301
703 706
789 222
64 672
272 19
78 38
754 555
543 498
74 466
236 472
155 125
491 700
794 192
62 169
637 407
540 385
122 106
4...

output:

123 826 574 550 102 10 761 120 703 783 420 144 582 616 602 368 267 482 559 330 271 824 514 655 740 696 194 447 86 598 80 588 536 766 823 821 427 679 587 773 770 836 315 376 435 638 517 213 725 479 640 278 3 410 661 216 468 714 406 720 353 718 591 562 262 404 401 169 485 63 417 533 280 664 799 790 73...

result:

ok Answer correct!

Test #17:

score: 17
Accepted
time: 192ms
memory: 92724kb

input:

34
33100 10117 18164
18635 32475
7408 21287
9517 5145
22923 26110
26263 11123
14870 20414
5233 11462
22918 19251
12631 11482
24262 28772
16262 4688
22280 31365
10129 23488
17195 15430
4602 1331
20453 6886
13707 24978
15951 7988
4834 23333
22314 7430
4956 2681
6703 9446
9417 33087
5722 1217
18525 174...

output:

10117 1 2 21484 4 5 6 24839 8 9 10 11 12 13 10574 15 16 17 18 19 20 9942 5273 23 24 25 26 27 4079 29 30 31 32 13093 34 35 36 30285 38 18665 40 41 42 6302 44 45 46 47 48 49 50 51 52 53 54 55 56 57 7804 59 60 18601 62 63 64 21514 66 67 68 69 70 71 72 73 6647 75 76 77 78 79 80 81 82 83 84 85 86 10222 8...

result:

ok Answer correct!

Subtask #4:

score: 0
Time Limit Exceeded

Test #18:

score: 0
Time Limit Exceeded

input:

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

output:

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

result:

Subtask #5:

score: 0
Time Limit Exceeded

Test #25:

score: 0
Time Limit Exceeded

input:

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

output:

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

result:

Subtask #6:

score: 10
Accepted

Test #34:

score: 10
Accepted
time: 3ms
memory: 73396kb

input:

10
1000 165 244
175 661
738 362
280 462
776 922
231 578
963 615
639 836
32 418
519 220
565 733
239 951
768 847
196 200
246 119
591 288
994 586
313 46
971 515
512 811
228 908
627 339
33 337
447 488
616 319
399 727
921 615
421 509
167 354
905 382
20 356
875 414
619 904
824 940
435 244
953 663
719 962
...

output:

165 1 2 3 4 5 6 7 8 9 10 11 557 13 14 917 16 69 18 19 97 21 22 23 24 25 611 27 28 29 30 31 32 33 34 35 36 984 844 39 40 41 42 43 44 768 46 47 48 49 969 51 52 53 54 55 56 328 58 59 60 61 62 63 64 296 66 67 68 17 992 71 658 73 74 75 76 352 78 79 427 81 82 83 84 85 86 87 88 641 90 91 92 93 94 95 96 20 ...

result:

ok Answer correct!

Test #35:

score: 10
Accepted
time: 7ms
memory: 73400kb

input:

10
1000 382 266
590 318
797 98
35 830
950 354
905 784
998 709
853 583
165 498
288 727
822 759
576 543
193 715
883 839
847 872
255 61
995 187
125 742
575 697
621 939
711 248
445 683
848 907
171 215
511 807
196 453
166 930
231 716
327 96
866 680
909 549
188 554
33 273
486 74
32 577
37 573
376 148
709 ...

output:

382 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 641 90 91 92 93 94 95 96 97 98 99 100 613...

result:

ok Answer correct!

Test #36:

score: 10
Accepted
time: 4ms
memory: 71348kb

input:

10
1000 252 455
479 592
266 350
335 8
117 54
580 751
999 484
73 339
97 325
96 336
629 247
947 425
374 458
666 716
498 402
859 866
361 441
627 365
372 505
456 485
376 379
422 416
72 498
489 369
211 537
909 508
12 23
523 738
714 383
556 447
548 773
521 353
76 581
555 780
565 148
672 15
570 768
888 39
...

output:

252 1 2 3 4 5 6 7 8 9 10 11 557 13 14 917 16 427 18 19 97 21 22 23 24 25 611 27 28 29 30 31 32 33 994 35 36 439 844 39 40 41 42 43 523 768 46 47 48 49 969 51 437 53 54 55 56 327 58 59 60 61 62 63 64 295 66 67 68 17 992 598 658 73 74 75 76 351 78 79 426 81 82 83 84 85 86 87 88 641 90 91 92 93 94 95 4...

result:

ok Answer correct!

Test #37:

score: 10
Accepted
time: 3ms
memory: 73340kb

input:

10
1000 304 234
651 949
290 646
953 375
867 994
71 810
114 466
924 223
583 869
947 766
627 169
100 616
847 801
20 138
886 364
320 941
866 188
408 606
762 366
842 325
934 184
122 918
736 773
348 289
876 770
913 227
274 176
727 87
18 280
305 595
774 884
441 582
328 711
829 836
891 503
45 971
804 500
6...

output:

304 1 2 3 4 5 6 7 8 9 10 11 557 13 14 917 16 69 18 19 97 21 22 23 24 25 611 27 28 29 30 31 32 33 34 35 36 984 844 39 40 41 42 43 44 768 46 47 48 49 969 51 52 53 54 55 56 328 58 59 60 61 62 63 64 295 66 67 68 17 992 71 658 73 74 75 76 352 78 79 427 81 82 83 84 85 86 87 88 641 90 91 92 93 94 95 96 20 ...

result:

ok Answer correct!

Test #38:

score: 10
Accepted
time: 7ms
memory: 73336kb

input:

10
1000 105 350
300 724
309 285
319 499
170 893
469 224
304 775
964 858
625 758
529 516
328 239
585 559
341 670
135 549
810 328
439 251
49 198
265 691
30 101
146 261
376 929
981 434
980 439
191 601
764 888
731 801
706 824
203 210
83 419
41 812
176 472
226 117
156 280
996 478
902 761
75 57
542 969
36...

output:

105 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 613 ...

result:

ok Answer correct!

Subtask #7:

score: 0
Skipped

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

0%
English 繁體中文 简体中文

伺服器時間: 2024-12-05 08:44:03 | 開源專案