oj.uz

Submission #890289

# Submission time Handle Problem Language Result Execution time Memory
890289 2023-12-21T00:46:49 Z activedeltorre Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 127 ms 11716 KB 
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>

using namespace std;
map<int,int>fre;
int v[155005],m,k,n;
vector<int>vec;
int calc(int i ,int j)
{
    int useless,st,dr;
    if(fre[v[i]+v[j]]==1)
    {
        return 0;
    }
    fre[v[i]+v[j]]=1;
    useless=i-1+m-j;
    st=i;
    dr=j;
    int grupe=0;
    while(useless<=k)
    {
        if(dr<=st)
        {
            break;
        }
        if(v[st]+v[dr]==v[i]+v[j])
        {
            vec.push_back(v[st]);
            vec.push_back(v[dr]);
            st++;
            dr--;
            grupe+=2;
        }
        else if(v[st]+v[dr]<v[i]+v[j])
        {
            st++;
            useless++;
        }
        else
        {
            dr--;
            useless++;
        }
        if(grupe==n)
        {
            break;
        }
    }
    if(grupe>=n)
    {
        sort(vec.begin(),vec.end());
        for(i=0;i<n;i++)
        {
            cout<<vec[i]<<" ";
        }
        return 1;
    }
    vec.clear();
    return 0;
}
int main()
{
    int i,j,l,z;
    cin>>n>>k;
    m=n+k;
    for(i=1;i<=m;i++)
    {
        cin>>v[i];
    }
    int imp=0;
    for(i=1;i<=k+1;i++)
    {
        for(j=0;j<=k;j++)
        {
            z=m-j;
            if(z>i && imp==0)
            {
                if(calc(i,z)==1)
                {
                    imp=1;
                }
            }
        }
    }
    return 0;
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:65:13: warning: unused variable 'l' [-Wunused-variable]
   65 |     int i,j,l,z;
      |             ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1116 KB Output is correct
2 Correct 64 ms 4688 KB Output is correct
3 Correct 63 ms 4504 KB Output is correct
4 Correct 63 ms 4548 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 4548 KB Output is correct
2 Correct 71 ms 4548 KB Output is correct
3 Correct 64 ms 4552 KB Output is correct
4 Correct 66 ms 4548 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 444 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 67 ms 4500 KB Output is correct
3 Correct 63 ms 4548 KB Output is correct
4 Correct 63 ms 4584 KB Output is correct
5 Correct 64 ms 4812 KB Output is correct
6 Correct 64 ms 4548 KB Output is correct
7 Correct 77 ms 4608 KB Output is correct
8 Correct 62 ms 4620 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 127 ms 11716 KB Output is correct
3 Correct 63 ms 4548 KB Output is correct
4 Correct 89 ms 7964 KB Output is correct
5 Correct 62 ms 4552 KB Output is correct
6 Correct 64 ms 4604 KB Output is correct
7 Correct 89 ms 6860 KB Output is correct
8 Correct 74 ms 4548 KB Output is correct