제출 #717307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
717307		vjudge1	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3076 ms	3844 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'

const int M = 3e6+5, MOD = 998244353;
int ar[M], ind[M];

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int n, k;
    cin >> n >> k;

    n += k;
    vector<int> v(n);
    for (int &i:v) cin >> i;

    for (int i = 0; i < n; i++) ar[i] = v[i];
    for (int i = 0; i < n; i++) ind[i] = i;
    sort(ind, ind+n, [](int a, int b) {return ar[a] < ar[b];});

    sort(v.begin(), v.end());
    for (int i = 0; i < n; i++) {
        int x = v[i];
        swap(v[i], v.back());
        v.pop_back();
        sort(v.begin(), v.end());
        set<int> st;
        for (int j = 0; 2*j < v.size(); j++) st.insert(v[j]+v[n-j-2]);
        if (st.size() == 1) {
            for (int j = 1; j <= n; j++) if (j != ind[i]+1) cout << j << ' '; cout << endl;
            return 0;
        }

        v.push_back(x);
        sort(v.begin(), v.end());
    }

    return 0;
}
/*
5 4
1 3 1
3 5 2
5 4 3
4 2 1
-1
2 2 2

*/

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:31:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for (int j = 0; 2*j < v.size(); j++) st.insert(v[j]+v[n-j-2]);
      |                         ~~~~^~~~~~~~~~
tabletennis.cpp:33:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   33 |             for (int j = 1; j <= n; j++) if (j != ind[i]+1) cout << j << ' '; cout << endl;
      |             ^~~
tabletennis.cpp:33:79: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   33 |             for (int j = 1; j <= n; j++) if (j != ind[i]+1) cout << j << ' '; cout << endl;
      |                                                                               ^~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13