oj.uz

Submission #979249

# Submission time Handle Problem Language Result Execution time Memory
979249 2024-05-10T12:13:49 Z Rafi22 Island Hopping (JOI24_island) C++17
0 / 100
 1 ms 600 KB 
#include "island.h"

#include <bits/stdc++.h>
using namespace std;

void solve(int N, int L){
    int n=N;
    vector<vector<int>>is(n+1,vector<int>(n+1,0));
    for(int i=1;i<=n;i++)
    {
        vector<int>V;
        for(int j=1;j<n;j++)
        {
            int k=query(i,j);
            if(k>i) break;
            bool ok=1;
            for(auto x:V) if(is[x][k]) ok=0;
            if(!ok) break;
            answer(i,k);
            is[i][k]=1;
            is[k][i]=1;
        }
    }
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 500 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 500 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 500 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 500 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

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