Submission #70298

#TimeUsernameProblemLanguageResultExecution timeMemory
70298Just_Solve_The_ProblemBroken Device (JOI17_broken_device)C++11
0 / 100
80 ms12928 KiB
#include <bits/stdc++.h> #include "Annalib.h" //#include "grader.cpp" #define pb push_back using namespace std; void Anna( int N, long long X, int K, int P[] ){ vector < int > used(N, 0); vector < int > u(N, 0); for (int i = 0; i < K; i++) { used[P[i]] = 1; } for (int i = 0; i < N; i += 3) { if (used[i] + used[i + 1] + used[i + 2] >= 2) continue; if (used[i] + used[i + 1] + used[i + 2] == 1) { if (X % 2 == 0) { if (used[i]) { u[i + 2] = 1; } else if (used[i + 1]) { u[i + 2] = 1; } else { u[i] = u[i + 1] = 1; } } else { if (used[i]) { if (X % 4 == 1) { u[i + 1] = 1; } else { u[i + 1] = u[i + 2] = 1; } X /= 2; } if (used[i + 1]) { u[i] = 1; } if (used[i + 2]) { u[i] = 1; } } X /= 2; } else { u[i] = u[i + 1] = u[i + 2] = 1; if (X % 4 == 1) u[i] = u[i + 2] = 0; else if (X % 4 == 2) u[i + 1] = 0; else if (X % 4 == 3) u[i] = 0; X /= 4; } } for (int i = 0; i < N; i++) { Set(i, u[i]); } } /* 7 = (3, 4) 6 = (2, 4) 5 = (1, 4) 4 = (0, 4) 3 = (1, 2) 2 = (0, 2) 1 = (0, 2) 0 = (1, 2) */
#include <bits/stdc++.h> #include "Brunolib.h" //#include "grader.cpp" #define ll long long #define pb push_back using namespace std; pair < int, int > get(int x, int y, int z) { int t = x * 4 + y * 2 + z; if (t == 0) return {0, 1}; if (t == 1) return {0, 2}; if (t == 2) return {1, 4}; if (t == 3) return {3, 4}; if (t == 4) return {1, 2}; if (t == 5) return {1, 4}; if (t == 6) return {0, 2}; if (t == 7) return {0, 4}; } long long Bruno( int N, int A[] ){ ll ret = 0; for (int i = N - 4; i >= 0; i -= 3) { ret = ret * get(A[i], A[i + 1], A[i + 2]).second + get(A[i], A[i + 1], A[i + 2]).first; } return ret; }

Compilation message (stderr)

Bruno.cpp: In function 'std::pair<int, int> get(int, int, int)':
Bruno.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...