oj.uz

답안 #971260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971260 2024-04-28T09:19:05 Z aryanc403 커다란 상품 (IOI17_prize) C++17
20 / 100
 1000 ms 1048576 KB 
/*
  Compete against Yourself.
  Author - Aryan (@aryanc403)
*/
/*
  Credits -
  Atcoder library - https://atcoder.github.io/ac-library/production/document_en/ (namespace atcoder)
  Github source code of library - https://github.com/atcoder/ac-library/tree/master/atcoder
  https://codeforces.com/contest/4/submission/150120627
*/

#ifdef ARYANC403
    #include <header.h>
#else
    #pragma GCC optimize ("Ofast")
    // #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
    #pragma GCC target ("sse,sse2,mmx")
    #pragma GCC optimize ("-ffloat-store")
    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    #define dbg(args...) 42;
    #define endl "\n"
#endif

// y_combinator from @neal template https://codeforces.com/contest/1553/submission/123849801
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }

using namespace std;
#define fo(i,n)   for(i=0;i<(n);++i)
#define repA(i,j,n)   for(i=(j);i<=(n);++i)
#define repD(i,j,n)   for(i=(j);i>=(n);--i)
#define all(x) begin(x), end(x)
#define sz(x) ((lli)(x).size())
#define eb emplace_back
#define X first
#define Y second

using lli = long long int;
using mytype = long double;
using ii = pair<lli,lli>;
using vii = vector<ii>;
using vi = vector<lli>;

template <class T>
using ordered_set =  __gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
// X.find_by_order(k) return kth element. 0 indexed.
// X.order_of_key(k) returns count of elements strictly less than k.

// namespace Re = std::ranges;
// namespace Ve = std::ranges::views;

const lli SEED=chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 rng(SEED);
inline lli rnd(lli l,lli r)
{return uniform_int_distribution<lli>(l,r)(rng);}

int find_best(int n);
std::vector<int> ask(int i);

const lli LIM = 100;

int find_best(int n){
    const vector<int> bst = {0,0};
    if(n<=LIM){
        for(lli i=0;i<n;i++){
            if(ask(i)==bst)
                return i;
        }
    }

    map<lli,ii> dp;
    lli ans = -1;
    auto getVal = [&](const lli i)->ii{
        if(dp.count(i))
            return dp[i];
        const auto res = ask(i);
        dp[i]={res[0],res[1]};
        if(res==bst)
            ans=i;
        return dp[i];
    };

    lli mxVal=0;
    for(lli it=0;it<100;it++){
        const lli v=rnd(0,n-1);
        const auto res=getVal(v);
        mxVal=max(mxVal,res.X+res.Y);
    }

    y_combinator([&](const auto &self,lli l,lli r)->void{
        if(ans!=-1)
            return;
        while(l<=r){
            const auto res=getVal(l);
            if(res.X+res.Y>=mxVal)
                break;
            l++;
        }

        while(l<=r){
            const auto res=getVal(r);
            if(res.X+res.Y>=mxVal)
                break;
            r--;
        }

        if(l>r)
            return;
        if(getVal(l).X==getVal(r).X)
            return;
        const lli mid = (l+r)/2;
        self(l,mid);
        self(mid,r);
    })(0,n-1);
    dbg(dp);
    assert(ans!=-1);
    return ans;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:22:26: warning: statement has no effect [-Wunused-value]
   22 |     #define dbg(args...) 42;
      |                          ^~
prize.cpp:123:5: note: in expansion of macro 'dbg'
  123 |     dbg(dp);
      |     ^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 1 ms 612 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 436 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 444 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 696 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 444 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 3 ms 1384 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 4 ms 976 KB Output is correct
16 Correct 20 ms 1356 KB Output is correct
17 Correct 1 ms 448 KB Output is correct
18 Correct 24 ms 1016 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 7 ms 1228 KB Output is correct
21 Correct 13 ms 1148 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 1 ms 440 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 13 ms 1040 KB Output is correct
26 Correct 15 ms 996 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 21 ms 1400 KB Output is correct
29 Correct 16 ms 856 KB Output is correct
30 Correct 27 ms 1600 KB Output is correct
31 Correct 1 ms 440 KB Output is correct
32 Correct 3 ms 700 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 7 ms 516 KB Output is correct
35 Correct 2 ms 700 KB Output is correct
36 Correct 5 ms 752 KB Output is correct
37 Correct 1 ms 440 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 12 ms 1528 KB Output is correct
40 Correct 23 ms 1312 KB Output is correct
41 Correct 17 ms 1516 KB Output is correct
42 Correct 17 ms 1552 KB Output is correct
43 Correct 18 ms 1064 KB Output is correct
44 Correct 9 ms 776 KB Output is correct
45 Correct 7 ms 980 KB Output is correct
46 Correct 1 ms 444 KB Output is correct
47 Correct 11 ms 1744 KB Output is correct
48 Correct 29 ms 728 KB Output is correct
49 Correct 2 ms 460 KB Output is correct
50 Correct 28 ms 1756 KB Output is correct
51 Correct 11 ms 1480 KB Output is correct
52 Correct 1 ms 440 KB Output is correct
53 Correct 1 ms 444 KB Output is correct
54 Correct 10 ms 1512 KB Output is correct
55 Correct 1 ms 444 KB Output is correct
56 Correct 25 ms 1128 KB Output is correct
57 Correct 21 ms 1536 KB Output is correct
58 Correct 19 ms 1304 KB Output is correct
59 Correct 16 ms 1000 KB Output is correct
60 Correct 16 ms 1028 KB Output is correct
61 Correct 1 ms 440 KB Output is correct
62 Correct 1 ms 444 KB Output is correct
63 Correct 2 ms 612 KB Output is correct
64 Correct 1 ms 444 KB Output is correct
65 Correct 1 ms 448 KB Output is correct
66 Correct 3 ms 468 KB Output is correct
67 Correct 3 ms 880 KB Output is correct
68 Correct 3 ms 468 KB Output is correct
69 Correct 3 ms 460 KB Output is correct
70 Correct 2 ms 452 KB Output is correct
71 Correct 24 ms 1900 KB Output is correct
72 Correct 3 ms 472 KB Output is correct
73 Correct 29 ms 1188 KB Output is correct
74 Correct 28 ms 1416 KB Output is correct
75 Correct 1 ms 452 KB Output is correct
76 Correct 23 ms 788 KB Output is correct
77 Correct 29 ms 1636 KB Output is correct
78 Correct 3 ms 700 KB Output is correct
79 Correct 16 ms 1492 KB Output is correct
80 Correct 31 ms 776 KB Output is correct
81 Correct 28 ms 1260 KB Output is correct
82 Correct 27 ms 1764 KB Output is correct
83 Correct 2 ms 440 KB Output is correct
84 Correct 26 ms 1600 KB Output is correct
85 Correct 27 ms 1600 KB Output is correct
86 Correct 7 ms 1224 KB Output is correct
87 Correct 3 ms 696 KB Output is correct
88 Execution timed out 1521 ms 1048576 KB Time limit exceeded
89 Halted 0 ms 0 KB -