Submission #968928

#	Time	Username	Problem	Language	Result	Execution time	Memory
968928		CyberCow	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	1 ms	604 KiB

books

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

using namespace std;

const int N = 100010;
long long v[N];
map<long long, int> arj;

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

    for (int i = 1; i <= n; i++)
    {
        v[i] = skim(i);
        arj[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] <= a && a - v[i] - v[j] != v[i] && a - v[i] - v[j] != v[j])
            {
                if (arj[a - v[i] - v[j]])
                {
                    st = 1;
                    vector<int> ans;
                    ans.push_back(i);
                    ans.push_back(j);
                    ans.push_back(arj[a - v[i] - v[j]]);
                    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