제출 #693033

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
693033		Mher777	Table Tennis (info1cup20_tabletennis)	C++17	100 / 100	151 ms	4508 KiB

tabletennis

//////////////////////////////// Mher777
/* -------------------- Includes -------------------- */
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef float fl;
typedef double db;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    return;
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
    return;
}

ll gcd(ll a, ll b) {
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string to2(ll a)
{
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

bool isPrime(ll a) {
    if (a == 1) {
        return false;
    }
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) {
            return false;
        }
    }
    return true;
}

int dig_sum(ll a) {
    int sum = 0;
    while (a) {
        sum += int(a % 10);
        a /= 10;
    }
    return sum;
}

ll toDec(string s) {
    reverse(s.begin(), s.end());
    ll sum = 0;
    for (int i = 0; i < s.size(); i++) {
        int ia = s[i] - '0';
        sum += (ia * pow(2, i));
    }
    return sum;
}

ll binpow(ll a, int b) {
    ll ans = 1;
    while (b) {
        if ((b & 1) == 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    ll ans = 1;
    while (b) {
        if ((b & 1) == 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

ll factorial(int a) {
    ll ans = 1;
    for (int i = 2; i <= a; i++) {
        ans *= ll(i);
    }
    return ans;
}

ll factorial_by_mod(int a, ll mod) {
    ll ans = 1;
    for (int i = 2; i <= a; i++) {
        ans *= ll(i);
        ans %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 200005;
int a[N], ans[N];

void slv() {
    int n, k;
    cin >> k >> n;
    n += k;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) {
        for (int j = i + k - 1; j < n; j++) {
            int ind = 0;
            for (int l = i, r = j; 2 * ind < k; l++) {
                while (r > l && a[j] - a[r] < a[l] - a[i]) r--;
                if ((r <= l) || (r - l + 1 < k - 2 * ind)) break;
                if (a[j] - a[r] == a[l] - a[i]) {
                    ans[ind] = a[l];
                    ans[k - 1 - ind] = a[r];
                    ind++;
                    r--;
                }
            }
            if (2 * ind == k) {
                for (int q = 0; q < k; q++) cout << ans[q] << " ";
                return;
            }
        }
    }
}
void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    //precalc();
    //precision(3);
    cs();
    return 0;
}

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

tabletennis.cpp:25: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
   25 | #pragma warning(disable : 4996)
      | 
tabletennis.cpp:26: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
   26 | #pragma warning(disable : 6031)
      | 
tabletennis.cpp: In function 'll range_sum(ll, ll)':
tabletennis.cpp:95:21: warning: unused variable 'cnt' [-Wunused-variable]
   95 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
tabletennis.cpp: In function 'll toDec(std::string)':
tabletennis.cpp:141:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

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