oj.uz

Submission #1113510

# Submission time Handle Problem Language Result Execution time Memory
1113510 2024-11-16T17:08:53 Z imarn Island Hopping (JOI24_island) C++17
0 / 100
 11 ms 508 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define szz(r) (ll)r.size()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
using namespace std;
#include "island.h"

void solve(int N, int L) {int n=N;
    vector<int>vec;
    for(int i=1;i<=n-1;i++)vec.pb(query(1,i));
    int pr[N+1]={0};pr[1]=1;
    for(int i=2;i<=n;i++){
        int u=vec[i];
        for(int j=1;j<=n-1;j++){
            int v=query(u,j);
            if(!pr[v])continue;
            else {pr[u]=v;break;}
        }
    }
    for(int i=2;i<=n;i++)answer(pr[i],i);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 336 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 508 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 336 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -