oj.uz

Submission #397507

# Submission time Handle Problem Language Result Execution time Memory
397507 2021-05-02T10:05:45 Z MarcoMeijer Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 3144 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;
const int N = (1<<20);

int n, k, m;
int a[MX], b[MX];

bool exists(int i) {
    return *(lower_bound(a,a+m,i)) == i;
}
bool check(int x) {
    int cnt = 0;
    RE(i,m) {
        if(x-a[i] <= a[i]) break;
        if(exists(x-a[i])) cnt += 2;
    }
    return cnt>=n;
}

void program() {
    IN(n,k); m=n+k;
    RE(i,m) IN(a[i]);

    int y = min(k+1,m);
    RE(i,y) RE(j,y) if(check(a[i]+a[m-j-1])) {
        int x = a[i]+a[m-j-1];
        vi ans;
        RE(i,m) {
            if(x-a[i] <= a[i]) break;
            if(exists(x-a[i])) ans.pb(a[i]), ans.pb(x-a[i]);
            if(ans.size() == n) break;
        }
        sort(all(ans));
        OUTL(ans);
        return;
    }
    OUTL("huh?");
}

Compilation message

tabletennis.cpp: In function 'void program()':
tabletennis.cpp:91:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   91 |             if(ans.size() == n) break;
      |                ~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 716 KB Output is correct
2 Correct 55 ms 3144 KB Output is correct
3 Correct 51 ms 3092 KB Output is correct
4 Correct 52 ms 3084 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 3092 KB Output is correct
2 Correct 55 ms 3140 KB Output is correct
3 Correct 74 ms 3136 KB Output is correct
4 Correct 54 ms 3088 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 19 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 10 ms 336 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1328 ms 3076 KB Output is correct
3 Correct 112 ms 3008 KB Output is correct
4 Correct 706 ms 3088 KB Output is correct
5 Correct 78 ms 3008 KB Output is correct
6 Correct 88 ms 3080 KB Output is correct
7 Correct 692 ms 3084 KB Output is correct
8 Correct 71 ms 3092 KB Output is correct

Subtask #8
0 / 13.0

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