Submission #310233

#TimeUsernameProblemLanguageResultExecution timeMemory
310233galcaZagonetka (COI18_zagonetka)C++14
0 / 100
2 ms256 KiB
#include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> p(n); for (int i = 0; i < n; i++) { cin >> p[i]; } // assume 1 cond int i, j; bool found = false;; for (i = 0; i < n - 1; i++) { for (j = i + 1; j < n; j++) { cout << "query"; int k; for (k = 0; k < i; k++) { cout << " " << p[k]; } cout << " " << p[j]; ++k; for (; k < j; k++) { cout << " " << p[k]; } cout << " " << p[i]; ++k; for (; k < n; k++) { cout << " " << p[k]; } cout << endl; // endl auto-flushes int result1; cin >> result1; if (!result1) { found = true; break; } } if (found) { break; } } vector<int> minp(n); vector<int> maxp(n); cout << "end"; int k; int minval = 0; int maxval = n-1; for (k = 0; k < i; k++) { minp[k] = minval++; maxp[k] = maxval--; } if (k != n) { if (p[i] < p[j]) { minp[i] = minval++; maxp[j] = maxval--; for (int l = i + 1; l < j; l++) { minp[l] = minval++; maxp[l - 1] = maxval--; } minp[j] = minval++; } else { minp[j] = minval++; maxp[i] = maxval--; for (int l = i + 1; l < j; l++) { minp[l - 1] = minval++; maxp[l] = maxval--; } maxp[i] = maxval--; } for (k = j + 1; k < n; k++) { minp[k] = minval++; maxp[k] = maxval--; } } for (k=0; k < n; k++) { cout << minp[k] << " "; } cout << endl; for (k = 0; k < n; k++) { cout << maxp[k] << " "; } cout << endl; // endl auto-flushes if (i < n) { // } }

Compilation message (stderr)

zagonetka.cpp: In function 'int main()':
zagonetka.cpp:16:9: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   16 |  int i, j;
      |         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...