oj.uz

Submission #791614

# Submission time Handle Problem Language Result Execution time Memory
791614 2023-07-24T08:04:23 Z Sohsoh84 라멘 (JOI14_ramen) C++17
0 / 100
 1 ms 212 KB 
#include "ramen.h"
#include <bits/stdc++.h>

using namespace std;

void Ramen(int N) {
	vector<int> mn_poss, mx_poss;
	for (int i = 0; i < N - 1; i += 2) {
		if (Compare(i, i + 1)) {
			mn_poss.push_back(i + 1);
			mx_poss.push_back(i);
		} else {
			mn_poss.push_back(i);
			mx_poss.push_back(i);
		}
	}

	if (N & 1) {
		mn_poss.push_back(N - 1);
		mx_poss.push_back(N - 1);
	}

	int best_mx = mx_poss.front();
	for (int e : mx_poss)
		if (Compare(e, best_mx))
			best_mx = e;

	int best_mn = mn_poss.front();
	for (int e : mn_poss)
		if (Compare(best_mn, e))
			best_mn = e;

	Answer(best_mn, best_mx);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 212 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 212 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 212 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -