oj.uz

Submission #310236

# Submission time Handle Problem Language Result Execution time Memory
310236 2020-10-06T12:12:11 Z galca Zagonetka (COI18_zagonetka) C++14
0 / 100
 2 ms 256 KB 
#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[j] = maxval--;
		}
		for (k = j + 1; k < n; k++) {
			minp[k] = minval++;
			maxp[k] = maxval--;
		}
	}

	for (k=0; k < n; k++) {
		cout << " " << minp[k]+1;
	}
	cout << endl;
	for (k = 0; k < n; k++) {
		cout << " " << maxp[k]+1;
	}
	cout << endl; // endl auto-flushes

	return 0;
}

Compilation message

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;
      |         ^

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -