oj.uz

답안 #675152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675152 2022-12-27T02:13:53 Z bachhoangxuan Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 90 ms 6740 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define pii pair<int,int>
const int mod=998244353;
const int maxn=200005;
const int maxa=1000005;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
int n,k,a[maxn];
map<int,bool> mp;
bool cal(int i,int j){
    if(mp[a[i]+a[j]]) return false;
    mp[a[i]+a[j]]=true;
    int cnt=i-1+n+k-j;
    vector<int> ans;ans.push_back(a[i]);ans.push_back(a[j]);
    int lt=i+1,rt=j-1,sum=a[i]+a[j];
    while(lt<rt){
        if((int)ans.size()==n) break;
        while(rt>lt && a[rt]+a[lt]>sum){
            rt--;cnt++;
            if(cnt>k) return false;
        }
        if(rt==lt) break;
        if(a[rt]+a[lt]==sum){ans.push_back(a[lt]);ans.push_back(a[rt]);lt++;rt--;}
        else{lt++;cnt++;}
        if(cnt>k) return false;
    }
    if((int)ans.size()==n){
        sort(ans.begin(),ans.end());
        for(int v:ans) cout << v << ' ';
        return true;
    }
    return false;
}
void solve(){
    cin >> n >> k;
    for(int i=1;i<=n+k;i++) cin >> a[i];
    for(int i=1;i<=k+1;i++){
        for(int j=n+k;j>=max(i+1,n+i-1);j--){
            if(cal(i,j)) return;
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int t=1;//cin >> t;
    while(t--) solve();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 34 ms 3144 KB Output is correct
3 Correct 32 ms 3092 KB Output is correct
4 Correct 39 ms 3016 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 3044 KB Output is correct
2 Correct 33 ms 3088 KB Output is correct
3 Correct 40 ms 3024 KB Output is correct
4 Correct 34 ms 3100 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

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

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 36 ms 3052 KB Output is correct
3 Correct 39 ms 3024 KB Output is correct
4 Correct 30 ms 3012 KB Output is correct
5 Correct 36 ms 3016 KB Output is correct
6 Correct 37 ms 3112 KB Output is correct
7 Correct 38 ms 3060 KB Output is correct
8 Correct 36 ms 3000 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 90 ms 6740 KB Output is correct
3 Correct 38 ms 3012 KB Output is correct
4 Correct 84 ms 5864 KB Output is correct
5 Correct 30 ms 3012 KB Output is correct
6 Correct 43 ms 3196 KB Output is correct
7 Correct 78 ms 4420 KB Output is correct
8 Correct 33 ms 3120 KB Output is correct