結果
問題 | No.2828 Remainder Game |
ユーザー |
|
提出日時 | 2024-08-02 21:51:52 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,273 bytes |
コンパイル時間 | 2,014 ms |
コンパイル使用メモリ | 201,280 KB |
実行使用メモリ | 25,580 KB |
平均クエリ数 | 94.20 |
最終ジャッジ日時 | 2024-08-02 21:51:57 |
合計ジャッジ時間 | 4,497 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 8 WA * 12 |
ソースコード
#include <bits/stdc++.h>using namespace std;void _main();int main() {_main();return 0;}using ll = long long;using ull = unsigned long long;using ld = long double;using vi = std::vector<int>;using vvi = std::vector<vi>;using vl = std::vector<ll>;using vii = std::vector<pair<int, int> >;using vvl = std::vector<vl>;using vll = std::vector<pair<ll , ll> >;using vd = std::vector<double>;using vvd = std::vector<vd>;using vs = std::vector<std::string>;using vvs = std::vector<vs>;using vb = std::vector<bool>;using vvb = std::vector<vb>;using vc = std::vector<char>;using vvc = std::vector<vc>;using pii = std::pair<int, int>;using pll = std::pair<ll, ll>;using piil = std::pair<pair<int, int>, ll>;using mii = std::map<int, int>;using mll = std::map<ll, ll>;using pql = std::priority_queue<ll>;using pqi = std::priority_queue<int>;using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;using pqii = std::priority_queue<pair<int, int> >;#define pb push_back#define ps push#define eb emplace_back#define is insert#define er erase#define f first#define s second#define lb lower_bound#define ub upper_bound#define sf(i) sizeof(i)#define endl "\n"#define sz(v) ((int)(v).size())#define all(v) (v).begin(), (v).end()#define rep(i, L, R) for(ll i = L;i<=R;i++)#define pcis precisiontemplate<typename T>struct infinity {static constexpr T max=std::numeric_limits<T>::max();static constexpr T min=std::numeric_limits<T>::min();static constexpr T value=std::numeric_limits<T>::max()/2;static constexpr T mvalue=std::numeric_limits<T>::min()/2;};template<typename T>constexpr T INF=infinity<T>::value;constexpr ll lINF=INF<ll>;constexpr int iINF = INF<int>;constexpr ld PI = 3.1415926535897932384626;ll N;ll SUM = 0;void DNC(ll left, ll right, ll cnt) {if (cnt == 0)return;// N+1로 나눔if (left == right) {SUM += (left==0?N:left)*cnt;return;}ll mid = (left+right)/2;cout << N << " " << mid-left+1 << endl;for (ll i = left; i<=mid; i++)cout << i << " ";cout << endl;ll S;cin >> S;DNC(left, mid, S);DNC(mid+1, right, cnt-S);return;}void _main() {// N으로 나눈 나머지 이분cin >> N;DNC(0, N-1, 5);cout << 0<< " " << 1 << endl;cout <<SUM << endl;}