oj.uz

Submission #246762

# Submission time Handle Problem Language Result Execution time Memory
246762 2020-07-10T06:59:13 Z Autoratch Xylophone (JOI18_xylophone) C++14
0 / 100
 5 ms 256 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 5001;

int a[N],b[N],d[N];

void solve(int n)
{
    for(int i = 1;i < n;i++) a[i] = query(i,i+1);
    for(int i = 1;i < n-1;i++) b[i] = query(i,i+2);
    int now = -1,cur = 1,mn = 1;
    for(int i = 1;i < n;i++) 
    {
        d[i] = now*a[i];
        if(b[i]==a[i] or b[i]==a[i+1]) now = -now;
        cur+=d[i];
        mn = min(mn,cur);
    }
    int st = 1+1-mn;
    for(int i = 1;i <= n;i++)
    {
        answer(i,st);
        st+=d[i];
    }
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -