Submission #1019816

#TimeUsernameProblemLanguageResultExecution timeMemory
1019816UnforgettableplBroken Device 2 (JOI22_device2)C++17
5 / 100
2018 ms22132 KiB
#include "Anna.h" #include <bits/stdc++.h> using namespace std; const int M = 2000; namespace { pair<int,int> generate(long long x){ long long curr = 0; for(int len=1;len<=M;len++){ for(int turnedon=0;turnedon<=2*len;turnedon++){ if(curr++==x)return {len,turnedon}; } } assert(false); } } int Declare() {return M;} pair<vector<int>, vector<int>> Anna(long long A) { auto [len,ones] = generate(A); vector<int> a(len,0),b(len,0); for(int&i:a)if(ones){i=1;ones--;} for(int&i:b)if(ones){i=1;ones--;} return {a,b}; }
#include "Bruno.h" #include <bits/stdc++.h> using namespace std; const int M = 2000; namespace { long long generate(int tarlen,int taron){ long long curr = 0; for(int len=1;len<=M;len++){ for(int turnedon=0;turnedon<=2*len;turnedon++){ if(len==tarlen and turnedon==taron)return curr; curr++; } } assert(false); } } long long Bruno(vector<int> u) { int len = u.size()/2; int ones = 0; for(int&i:u)ones+=i; return generate(len,ones); }
#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...