제출 #883436

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883436		boris_mihov	"The Lyuboyn" code (IZhO19_lyuboyn)	C++17	3 / 100	1 ms	756 KiB

lyuboyn

#include <algorithm>
#include <iostream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <vector>
#include <bitset>
#include <queue>
#include <set>

typedef long long llong;
const int MAXN = (1 << 18) + 10;
const int MAXLOG = 18;

int n, k, t, s;
void solve()
{    
    if (k % 2 == 0)
    {
        std::cout << -1 << '\n';
        return;
    } 
}

void input()
{
    std::cin >> n >> k >> t;
    std::cin >> s;
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int tests;
int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 5
• Subtask 3: 3 / 3
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 31
• Subtask 8: 0 / 17