oj.uz

답안 #365986

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365986 2021-02-12T16:03:21 Z ahmedfouadnew Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 65404 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;
    int cnt=0;
    for(int i=0;i<n+k;i++)
    {
        if(mp[bal-a[i]])
        {
            v.pb(a[i]);
        }
        else cnt++;
        if(cnt>k) return;
    }
    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:22:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |     if(v.size()!=n) return;
      |        ~~~~~~~~^~~
tabletennis.cpp:23:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
tabletennis.cpp:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |         scanf("%d",a+i);
      |         ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1644 KB Output is correct
2 Correct 98 ms 10804 KB Output is correct
3 Correct 116 ms 10676 KB Output is correct
4 Correct 106 ms 10712 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 10680 KB Output is correct
2 Correct 98 ms 10760 KB Output is correct
3 Correct 91 ms 10804 KB Output is correct
4 Correct 93 ms 10676 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 150 ms 18856 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 108 ms 14940 KB Output is correct
5 Correct 2 ms 748 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 127 ms 10932 KB Output is correct
3 Correct 114 ms 10676 KB Output is correct
4 Correct 91 ms 10804 KB Output is correct
5 Correct 98 ms 10676 KB Output is correct
6 Correct 104 ms 10724 KB Output is correct
7 Correct 94 ms 10804 KB Output is correct
8 Correct 88 ms 10804 KB Output is correct

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 7348 KB Output is correct
2 Execution timed out 3084 ms 65404 KB Time limit exceeded
3 Halted 0 ms 0 KB -