oj.uz

Submission #881496

# Submission time Handle Problem Language Result Execution time Memory
881496 2023-12-01T10:00:55 Z 12345678 Carnival (CEOI14_carnival) C++17
0 / 100
 56 ms 1484 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int nx=155;
int n, res, cnt, vs[nx], ans[nx];
vector<int> d[nx];
 
int query(int a, int b)
{
    cout<<2<<' '<<a<<' '<<b<<'\n';
    cin>>res;
    return res;
}
 
void dfs(int u, int p)
{
    vs[u]=1;
    ans[u]=cnt;
    for (auto v:d[u]) if (v!=p&&!vs[v]) dfs(v, u);
}
 
int main()
{
    cin>>n;
    for (int i=1; i<=n; i++) for (int j=i+1; j<=n; j++) if (query(i, j)==2) d[i].push_back(j), d[j].push_back(i);
    for (int i=1; i<=n; i++) if (!vs[i]) cnt++, dfs(i, i);
    cout<<0;
    for (int i=1; i<=n; i++) cout<<' '<<ans[i];
    cout<<'\n';
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 1484 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 1212 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 344 KB Integer 2 violates the range [1, 1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 1008 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 948 KB Incorrect
2 Halted 0 ms 0 KB -