oj.uz

Submission #920538

# Submission time Handle Problem Language Result Execution time Memory
920538 2024-02-02T17:36:43 Z TsotneSV Table Tennis (info1cup20_tabletennis) C++17
53 / 100
 3000 ms 3280 KB 
#include <bits/stdc++.h>
using namespace std;
/* /\_/\
  (= ._.)
  / >  \>
*/
//#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") // codeforces

// #define int long long
#define fi first
#define se second
#define pb push_back
#define ins insert
#define mp make_pair
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(0);}
#define endl '\n'
#define sz(x) ((long long) (x).size())
#define all(x) (x).begin(),(x).end()
#define print(x) cout<<(x)<<" ";
#define printl(x) cout<<(x)<<endl
#define dbg(x) cerr<<#x<<" "<<x<<endl

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

void fileIO(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;

const int inf=1e9,MAXN=2e5+5; 
const ll INF=1e18; 
const ld pi = 3.14159265358979323846;

int n,k;

void solve(int tc = 0){
    cin>>n>>k; int A[n+k];

    for(int i=0;i<n+k;i++) {
        cin>>A[i];
    }

    for(int i=0;i<k;i++) {
        for(int j=n+k-1;j-i+1>=n;j--) {

            int l = i+1,r = j-1;
            vi arr1,arr2; arr1.pb(A[i]); arr2.pb(A[j]);
            
            while(l < r) {
                
                if(A[l] + A[r] < A[i] + A[j]) {
                    l++;
                }else if(A[l] + A[r] > A[i] + A[j]) {
                    r--;
                }else {
                    arr1.pb(A[l]);
                    arr2.pb(A[r]);
                    l++;
                    r--;
                }
            }

            if(sz(arr1) + sz(arr2) >= n) {
                for(int t=0;t<n/2;t++) {
                    print(arr1[t]);
                }

                for(int t=0;t<n/2;t++) {
                    print(arr2[sz(arr2) - t - 1]);
                }
                return;
            }

        }
    }

}

signed main(){
  
    send help
  
    int tc=1;
    // cin>>tc;
    for(int t = 0; t < tc; t++) solve(t);
}

Compilation message

tabletennis.cpp: In function 'void fileIO(std::string)':
tabletennis.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tabletennis.cpp:39:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 860 KB Output is correct
2 Incorrect 13 ms 860 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3280 KB Output is correct
2 Correct 21 ms 3276 KB Output is correct
3 Incorrect 12 ms 856 KB Unexpected end of file - int32 expected
4 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 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 1 ms 348 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 0 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 344 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 348 KB Output is correct
2 Correct 152 ms 3180 KB Output is correct
3 Correct 27 ms 3200 KB Output is correct
4 Correct 39 ms 3068 KB Output is correct
5 Correct 26 ms 3268 KB Output is correct
6 Correct 36 ms 3248 KB Output is correct
7 Correct 39 ms 3176 KB Output is correct
8 Correct 28 ms 3280 KB Output is correct

Subtask #8
0 / 13.0

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