Submission #259473

#TimeUsernameProblemLanguageResultExecution timeMemory
259473dorijanlendvajTwo Transportations (JOI19_transportations)C++14
0 / 100
1170 ms1280 KiB
#include "Azer.h" #include <vector> namespace { int N; int variable_example[500000]; int count; } // namespace void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C) { ::N = N; for (int i = 0; i < A; ++i) { variable_example[i] = U[i] + V[i] - C[i]; } SendA(true); count = 1; } void ReceiveA(bool x) { ++count; if (count < 58000) { SendA(x); ++count; } } std::vector<int> Answer() { std::vector<int> ans(N); for (int k = 0; k < N; ++k) { ans[k] = variable_example[k]; } return ans; }
#include "Baijan.h" #include <vector> namespace { int N; int count; bool FunctionExample(bool P) { return !P; } } // namespace void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D) { ::N = N; count = 0; } void ReceiveB(bool y) { ++count; if (count < 58000) { SendB(FunctionExample(y)); ++count; } }
#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...