結果
問題 | No.2978 Lexicographically Smallest and Largest Subarray |
ユーザー |
|
提出日時 | 2024-12-02 14:51:57 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,731 bytes |
コンパイル時間 | 5,835 ms |
コンパイル使用メモリ | 336,652 KB |
実行使用メモリ | 25,592 KB |
平均クエリ数 | 1499.00 |
最終ジャッジ日時 | 2024-12-02 14:52:21 |
合計ジャッジ時間 | 19,650 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 39 WA * 18 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }typedef long long ll;typedef vector<vector<int>> Graph;typedef pair<int, int> pii;typedef pair<ll, ll> pll;#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)#define rep(i,n) for (int i = 0;i < (int)(n); i++)#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define my_sort(x) sort(x.begin(), x.end())#define my_max(x) *max_element(all(x))#define my_min(x) *min_element(all(x))template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }const int INF = (1<<30) - 1;const ll LINF = (1LL<<62) - 1;const int MOD = 998244353;const int MOD2 = 1e9+7;const double PI = acos(-1);vector<int> di = {1,0,-1,0};vector<int> dj = {0,1,0,-1};#ifdef LOCAL# include <debug_print.hpp># define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endif// [l1, r1), [l2, r2) (0-indexed)int query(int l1, int r1, int l2, int r2){cout << "? ";cout << l1 + 1 << ' ';cout << r1 << ' ';cout << l2 + 1 << ' ';cout << r2 << endl;int X; cin >> X;return X;}int main(){cin.tie(0);ios_base::sync_with_stdio(false);int N, Q; cin >> N >> Q;vector<int> A(N);vector<int> mx, mn;rep(i, N / 2) {int X = query(2 * i, 2 * i + 1, 2 * i + 1, 2 * i + 2);if(X == 1) {mn.push_back(2 * i);mx.push_back(2 * i + 1);}if(X == 0) {mn.push_back(2 * i + 1);mx.push_back(2 * i);}if(X == -1){return 0;}}while((int)mn.size() > 1){vector<int> nmn;while((int)mn.size() >= 2){int p = mn.back();mn.pop_back();int q = mn.back();mn.pop_back();int X = query(p, p + 1, q, q + 1);if(X == 1){nmn.push_back(p);}if(X == 0){nmn.push_back(q);}if(X == -1){return 0;}}while(!mn.empty()){nmn.push_back(mn.back());mn.pop_back();}swap(nmn, mn);}while((int)mx.size() > 1){vector<int> nmx;while((int)mx.size() >= 2){int p = mx.back();mx.pop_back();int q = mx.back();mx.pop_back();int X = query(p, p + 1, q, q + 1);if(X == 1){nmx.push_back(q);}if(X == 0){nmx.push_back(p);}if(X == -1){return 0;}}while(!mx.empty()){nmx.push_back(mx.back());mx.pop_back();}swap(nmx, mx);}assert((int)mx.size() == 1);assert((int)mn.size() == 1);cout << "! ";cout << mn[0] + 1 << ' ';cout << mn[0] + 1 << ' ';cout << mx[0] + 1 << ' ';cout << N << endl;}