oj.uz

Submission #953732

# Submission time Handle Problem Language Result Execution time Memory
953732 2024-03-26T15:10:04 Z De3b0o Game (APIO22_game) C++17
0 / 100
 0 ms 344 KB 
#include "game.h"
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
//#define lc (2*n)
//#define rc (2*n+1)

using namespace std;

bitset<900000000> path(0);


ll K , N;
ll m;

void init(int n, int k)
{
    N=n;
    K=k;
    for(int i = 0 ; n>i ; i++)
        for(int j = 0 ; n>i ; i++)
            path.reset(j+i*N);
    for(int i = 0 ; k>i ; i++)
        for(int j = i+1 ; k>j ; j++)
            path.set(j+i*N);
}

int add_teleporter(int u, int v)
{
    m++;
    if(path.test(v+u*N)==1)
        return 0;
    path.set(v+u*N);
    for(int i = 0 ; N>i ; i++)
    {
        if(path.test(u+i*N)==1)
        {
            path.set(v+i*N);
            for(int j = 0 ; N>j ; j++)
            {
                if(path.test(j+v*N)==1)
                {
                    path.set(j+u*N);
                    path.set(j+i*N);
                    cout << u << " " << v << " " << i << " " << j << "\n";
                }
            }
        }
    }
    for(int i = 0 ; K>i ; i++)
    {
        if(path.test(i+i*N)==1)
            return 1;
    }
    return 0;
}

Subtask #1
0.0 / 2.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 18.0

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

Subtask #4
0.0 / 30.0

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

Subtask #5
0.0 / 40.0

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