oj.uz

Submission #522997

# Submission time Handle Problem Language Result Execution time Memory
522997 2022-02-06T18:21:44 Z Farhan_HY Table Tennis (info1cup20_tabletennis) C++14
9 / 100
 69 ms 2904 KB 
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(); cin.tie(0); cout.tie(0);

using namespace std;

const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
int a[N];
int n, m;
set<int> st;
set<int> ans;

main()
{
    cin >> n >> m;
    n += m;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    int l = 0, r = n - 1;
    st.insert(a[l] + a[r]);
    st.insert(a[l + 1] + a[r]);
    st.insert(a[l] + a[r - 1]);
    if (m > 1)
    {
        st.insert(a[l] + a[r - 2]);
        st.insert(a[l + 2] + a[r]);
    }
    for(auto x: st)
    {
        l = 0, r = n - 1;
        bool ok = true;
        int cnt = 2;
        ans.clear();
        while(l < r)
        {
            if (a[l] + a[r] == x)
            {
                l++;
                r--;
                continue;
            }
            if (l != n - 1 && a[l + 1] + a[r] == x && l + 1 != r)
            {
                cnt++;
                ans.insert(l);
                l += 2;
                r--;
                continue;
            }
            if (r != 0 && a[l] + a[r - 1] == x && l != r - 1)
            {
                cnt++;
                ans.insert(r);
                r -= 2;
                l++;
                continue;
            }
            ok = false;
            l++, r--;
        }
        if (ok && cnt <= m) break;
    }
    int cnt = 0;
    for(int i = 0; i < n; i++)
    {
        if (cnt == n - m)
            break;
        if (st.find(i) == st.end()) cout << a[i] << ' ', cnt++;
    }
}

Compilation message

tabletennis.cpp:22:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main()
      | ^~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output does not have symmetry property
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 580 KB Output does not have symmetry property
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 2888 KB Output does not have symmetry property
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output does not have symmetry property
3 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

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

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 332 KB Output does not have symmetry property
3 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 69 ms 2904 KB Output does not have symmetry property
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 68 ms 2860 KB Output does not have symmetry property
3 Halted 0 ms 0 KB -