Submission #1205484

#TimeUsernameProblemLanguageResultExecution timeMemory
1205484HanksburgerTable Tennis (info1cup20_tabletennis)C++20
0 / 100
18 ms2552 KiB
#include <bits/stdc++.h>
using namespace std;
int a[150405];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(0));
    int n, k;
    cin >> n >> k;
    for (int i=1; i<=n+k; i++)
        cin >> a[i];
    while (1)
    {
        int x=rand()%(n+k)+1, l=max(1, n+1-x), r=min(n+k, n+k*2+1-x);
        for (int i=l; i<=r; i++)
        {
            int sum=a[x]+a[i], L=1, R=n+k;
            vector<int> ans;
            while (ans.size()<n && L<R)
            {
                if (a[L]+a[R]<sum)
                    L++;
                else if (a[L]+a[R]>sum)
                    R--;
                else
                {
                    ans.push_back(L);
                    ans.push_back(R);
                    L++, R--;
                }
            }
            if (ans.size()==n)
            {
                sort(ans.begin(), ans.end());
                for (int u:ans)
                    cout << u << ' ';
                return 0;
            }
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...