oj.uz

답안 #358392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
358392 2021-01-25T12:07:36 Z Lam_lai_cuoc_doi Xylophone (JOI18_xylophone) C++17
0 / 100
 57 ms 620 KB 
#include <iostream>
#include <cstdio>
#include <set>
#include <vector>
#define task ""
using namespace std;
using ll = long long;
using ld = long double;

const int N = 5e3 + 2;

/*int query(int u, int v)
{
    cout << u << " " << v << "\n";
    int a;
    cin >> a;
    return a;
}

void answer(int u, int v)
{
    cout << u << ": " << v << "\n";
}*/

#include "xylophone.h"

void solve(int n)
{
    vector<vector<int>> a(n + 1, vector<int>(n + 1));
    vector<set<pair<int, int>>> s(n + 1);
    for (int i = 1; i < n; ++i)
    {
        a[i][i + 1] = query(i, i + 1);
        s[a[i][i + 1]].insert({i, i + 1});
    }
    for (int i = 1; i < n - 1; ++i)
    {
        int v = query(i, i + 2);
        if (v == a[i][i + 1] + a[i + 1][i + 2])
        {
            a[i][i + 2] = v;
            s[v].insert({i, i + 2});
        }
        else
        {
            if (v == a[i][i + 1])
            {
                a[i][i + 2] = v - a[i + 1][i + 2];
                s[a[i][i + 2]].insert({i, i + 2});
            }
            else
            {
                a[i][i + 2] = v - a[i][i + 1];
                s[a[i][i + 2]].insert({i, i + 2});
            }
        }
    }
    for (int i = 3; i < n; ++i)
    {
        int sum(0);
        for (int j = 1; j < i - 1; ++j)
            sum += a[j][j + 1];
        for (int j = 1; j <= n - i; ++j)
        {
            sum -= a[j - 1][j];
            sum += a[j + i - 1][j + i];
            int v = query(j, i + j);
            if (v == sum)
            {
                a[j][i + j] = v;
                s[v].insert({j, i + j});
            }
            else
            {
                auto t = s[v].lower_bound({j, 0});
                if (t->first == j)
                {
                    a[j][i + j] = v - a[t->second][j + i];
                    s[a[j][i + j]].insert({j, i + j});
                }
                else if (t->second == j + i)
                {
                    a[j][i + j] = v - a[j][t->first];
                    s[a[j][j + i]].insert({j, j + i});
                }
                else
                {
                    a[j][i + j] = v - min(a[j][t->first] + a[t->second][j + i], a[j][t->second] + a[t->first][j + i]);
                    s[a[j][j + i]].insert({j, j + i});
                }
            }
        }
    }
    int pos;
    for (int i = 1; i <= n; ++i)
        for (int j = i + 1; j <= n; ++j)
            if (a[i][j] == n - 1)
            {
                pos = i;
                goto done;
            }
done:;
    /*for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            cout << a[min(i, j)][max(i, j)] << " ";
        cout << "\n";
    }*/
    for (int i = 1; i <= n; ++i)
    {
        if (i == pos)
            answer(i, 1);
        else
            answer(i, 1 + (i < pos ? a[i][pos] : a[pos][i]));
    }
    for (int i = 1; i <= n; ++i)
        s[i].clear();
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:94:9: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   94 |     int pos;
      |         ^~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 11 ms 364 KB Output is correct
4 Incorrect 57 ms 620 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 11 ms 364 KB Output is correct
4 Incorrect 57 ms 620 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 11 ms 364 KB Output is correct
4 Incorrect 57 ms 620 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -