Submission #973697

#TimeUsernameProblemLanguageResultExecution timeMemory
973697penguin133Hidden Sequence (info1cup18_hidden)C++17
0 / 100
3 ms444 KiB
#include <bits/stdc++.h> using namespace std; #include "grader.h" //#define int long long #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); vector < int > findSequence (int N) { vector <int> x; for(int i = 0; i < N / 2 + 1; i++)x.push_back(0); if(isSubsequence(x)){ int ones = 0; while(1){ x.clear(); for(int i = 0; i < ones + 1; i++)x.push_back(1); if(isSubsequence(x))ones++; else break; } vector <int> ans; int num0 = 0, num1 = 0, f = 0; x.clear(); for(int i = 0; i < N / 2 + 1 - ones; i++)x.push_back(0); for(int i = 0; i < ones; i++)x.push_back(1); if(isSubsequence(x)){ int zrs = 0; while(1){ vector <int> qry; qry.push_back(1); for(int i = 0; i < zrs + 1; i++)qry.push_back(0); if(isSubsequence(qry))zrs++; else break; } for(int i = 0; i < N - ones - zrs; i++)ans.push_back(0); ans.push_back(1); f = 1; num0 += N - ones - zrs; num1++; } for(int i = f; i < ones; i++){ int zrs = 0; while(1){ vector <int> qry; for(int j = 0; j < num1; j++)qry.push_back(1); for(int j = 0; j < zrs + 1; j++)qry.push_back(0); for(int j = 0; j < ones - i; j++)qry.push_back(1); //if(qry.size() > N)break; if(qry.size() > N / 2 + 1){ qry.clear(); for(int j = 0; j < num0; j++)qry.push_back(0); qry.push_back(1); qry.push_back(0); qry.push_back(1); //if(!isSubsequence(qry))break; int tot = N - ones - num0 - (zrs + 1); if(tot < 0){ zrs--; break; } for(int j = 0; j < tot; j++)qry.push_back(0); if(!isSubsequence(qry))zrs++; else { zrs++; break; } } else if(isSubsequence(qry))zrs++; else break; } for(int j = 0; j < zrs; j++)ans.push_back(0); ans.push_back(1); num0 += zrs; num1 += 1; } while(ans.size() < N)ans.push_back(0); return ans; } else{ int ones = 0; while(1){ x.clear(); for(int i = 0; i < ones + 1; i++)x.push_back(0); if(isSubsequence(x))ones++; else break; } vector <int> ans; int num0 = 0, num1 = 0, f = 0; x.clear(); for(int i = 0; i < N / 2 + 1 - ones; i++)x.push_back(1); for(int i = 0; i < ones; i++)x.push_back(0); if(isSubsequence(x)){ int zrs = 0; while(1){ vector <int> qry; qry.push_back(0); for(int i = 0; i < zrs + 1; i++)qry.push_back(1); if(isSubsequence(qry))zrs++; else break; } for(int i = 0; i < N - ones - zrs; i++)ans.push_back(1); ans.push_back(0); f = 1; num0++; num1 += N - ones - zrs; } for(int i = f; i < ones; i++){ int zrs = 0; while(1){ vector <int> qry; for(int j = 0; j < num0; j++)qry.push_back(0); for(int j = 0; j < zrs + 1; j++)qry.push_back(1); for(int j = 0; j < ones - i; j++)qry.push_back(0); //if(qry.size() > N)break; if(qry.size() > N / 2 + 1){ qry.clear(); for(int j = 0; j < num1; j++)qry.push_back(1); qry.push_back(0); qry.push_back(1); qry.push_back(0); //if(!isSubsequence(qry))break; int tot = N - ones - num1 - (zrs + 1); //cout << tot << ' ' << zrs << '\n'; if(tot < 0){ zrs--; break; } for(int j = 0; j < tot; j++)qry.push_back(1); if(!isSubsequence(qry))zrs++; else { zrs++; break; } } else if(isSubsequence(qry))zrs++; else break; } for(int j = 0; j < zrs; j++)ans.push_back(1); ans.push_back(0); num0++; num1 += zrs; } while(ans.size() < N)ans.push_back(1); return ans; } }

Compilation message (stderr)

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:54:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     if(qry.size() > N / 2 + 1){
      |        ~~~~~~~~~~~^~~~~~~~~~~
hidden.cpp:76:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |   while(ans.size() < N)ans.push_back(0);
      |         ~~~~~~~~~~~^~~
hidden.cpp:114:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  114 |     if(qry.size() > N / 2 + 1){
      |        ~~~~~~~~~~~^~~~~~~~~~~
hidden.cpp:137:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  137 |   while(ans.size() < N)ans.push_back(1);
      |         ~~~~~~~~~~~^~~
grader.cpp: In function 'int main()':
grader.cpp:28:26: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   28 |     fprintf (fifo_out, "%d\n", ans.size ());
      |                         ~^     ~~~~~~~~~~~
      |                          |              |
      |                          int            std::vector<int>::size_type {aka long unsigned int}
      |                         %ld
grader.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i=0; i<ans.size () && i < N; i++)
      |                   ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...