oj.uz

Submission #365969

# Submission time Handle Problem Language Result Execution time Memory
365969 2021-02-12T15:35:28 Z ahmedfouadnew Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 257200 KB 
#include<bits/stdc++.h>
using namespace std;
#define s second
#define f first
#define pb push_back
//#define int long long
int n,a[200001],k;
unordered_map<int,int>mp;
void fun(int bal)
{
    vector<int>v;
    for(int i=0;i<n+k;i++)
    {
        if(mp[bal-a[i]])
        {
            v.pb(a[i]);
        }
    }
    if(v.size()!=n) return;
    for(int i=0;i<v.size();i++)
    {
        if(i) printf(" ");
        printf("%d",v[i]);

    }
    exit(0);
}
signed main()
{
    scanf("%d%d",&n,&k);
    for(int i=0;i<n+k;i++)
    {
        scanf("%d",a+i);
        mp[a[i]]=1;
    }
    for(int i=0;i<=k+1;i++)
    {
        for(int j=n+k-1;j>=n-1;j--)
        {
            fun(a[i]+a[j]);
        }
    }

   return 0;
}

Compilation message

tabletennis.cpp: In function 'void fun(int)':
tabletennis.cpp:19:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |     if(v.size()!=n) return;
      |        ~~~~~~~~^~~
tabletennis.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
tabletennis.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%d",a+i);
      |         ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1644 KB Output is correct
2 Correct 268 ms 22316 KB Output is correct
3 Correct 165 ms 17500 KB Output is correct
4 Correct 179 ms 17628 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 34544 KB Output is correct
2 Correct 247 ms 22236 KB Output is correct
3 Correct 491 ms 42384 KB Output is correct
4 Correct 229 ms 22236 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 876 KB Output is correct
2 Correct 223 ms 29020 KB Output is correct
3 Correct 3 ms 1132 KB Output is correct
4 Correct 328 ms 30704 KB Output is correct
5 Correct 3 ms 1132 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 31 ms 9140 KB Output is correct
3 Correct 8 ms 2168 KB Output is correct
4 Correct 101 ms 14644 KB Output is correct
5 Correct 6 ms 2168 KB Output is correct
6 Correct 5 ms 1260 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Execution timed out 3098 ms 257200 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 7732 KB Output is correct
2 Execution timed out 3060 ms 253344 KB Time limit exceeded
3 Halted 0 ms 0 KB -