제출 #968934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
968934		CyberCow	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	1 ms	864 KiB

books

#include "books.h"
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>

using namespace std;

const int N = 100010;
long long v[N];

void solve(int n, int k, long long a, int s) {

    set<pair<long long, int>> se;
    for (int i = 1; i <= n; i++)
    {
        v[i] = skim(i);
        se.insert({ v[i], i });
    }
    int st = 1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = i + 1; j <= n; j++)
        {
            if (!st && v[i] + v[j] <= 2 * a)
            {
                auto it = se.lower_bound({ a - v[i] + v[j], 0});
                if (it->first + v[i] + v[j] <= 2 * a && it->first + v[i] + v[j] >= a && it->first != v[i] && it->first != v[j])
                {
                    st = 1;
                    vector<int> ans;
                    ans.push_back(i);
                    ans.push_back(j);
                    ans.push_back(it->second);
                    sort(ans.begin(), ans.end());
                    answer({ ans });
                }
            }
        }
    }
    if (st == 0)
    {
        impossible();
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20