Submission #883436

#TimeUsernameProblemLanguageResultExecution timeMemory
883436boris_mihov"The Lyuboyn" code (IZhO19_lyuboyn)C++17
3 / 100
1 ms756 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...