oj.uz

답안 #1114456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114456 2024-11-18T23:20:30 Z sunboi Xylophone (JOI18_xylophone) C++17
0 / 100
 1 ms 336 KB 
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#include "xylophone.h"
 
static int A[5000];
 
 
void solve(int N){
    int n = N;
    int i = 1, fin = n;
    while(i < fin){
        int m = (i + fin) / 2;
        if (query(m, n) == n - 1){
            i = m + 1; 
        }else fin = i;
    }
    i--;
    int reference = i;
    vector<int> a(n + 1);
    int x = query(i, i + 1);
    a[i] = 1;
    a[i + 1] = x + 1;
    i += 2;
    int last = x;
    
    for (; i <= n; i++){
        int mn = min(a[i - 1], a[i - 2]);
        int uno = query(i - 1, i);
        int dos = query(i - 2, i);
        
        if (dos > last){
            if (dos == uno){
                if (a[i - 1] == mn) a[i] = a[i - 1] + uno;
                else a[i] = a[i - 1] - uno;
            }else{
                if (a[i - 2] == mn) a[i] = a[i - 2] + dos;
                else  a[i] = a[i - 2] - dos;
            }
        }else{
            if (a[i - 1] == mn) a[i] = a[i - 1] + uno;
            else a[i] = a[i - 1] - uno;
        }
        last = uno;
    }
    i = reference;
	if (i > 1){
		x = query(i - 1, i);
		a[i - 1] = 1 + x;
		last = x;
		i -= 2;
		for (; i >= 1; i--){
			int mn = min(a[i + 1], a[i + 2]);
			int uno = query(i, i + 1);
			int dos = query(i, i + 2);
			if (dos > last){
				if (dos == uno){
					if (a[i + 1] == mn) a[i] = a[i + 1] + uno;
					else a[i] = a[i + 1] - uno;
				}else{
					if (a[i + 2] == mn) a[i] = a[i + 2] + dos;
					else  a[i] = a[i + 2] - dos;
				}
			}else{
				if (a[i + 1] == mn) a[i] = a[i + 1] + uno;
				else a[i] = a[i + 1] - uno;
			}
			last = uno;
		}
	}
    for(int i = 1;i<=n;i++) answer(i, a[i]);
	return;
}

Compilation message

xylophone.cpp:8:12: warning: 'A' defined but not used [-Wunused-variable]
    8 | static int A[5000];
      |            ^

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -