結果
問題 | No.2978 Lexicographically Smallest and Largest Subarray |
ユーザー | sgfc |
提出日時 | 2024-12-02 02:36:51 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,038 bytes |
コンパイル時間 | 5,437 ms |
コンパイル使用メモリ | 314,592 KB |
実行使用メモリ | 25,592 KB |
平均クエリ数 | 1499.00 |
最終ジャッジ日時 | 2024-12-02 02:37:13 |
合計ジャッジ時間 | 19,334 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 170 ms
25,196 KB |
testcase_01 | AC | 170 ms
25,196 KB |
testcase_02 | AC | 194 ms
25,448 KB |
testcase_03 | AC | 170 ms
25,580 KB |
testcase_04 | WA | - |
testcase_05 | AC | 170 ms
24,556 KB |
testcase_06 | WA | - |
testcase_07 | AC | 193 ms
24,824 KB |
testcase_08 | AC | 194 ms
24,568 KB |
testcase_09 | AC | 195 ms
24,568 KB |
testcase_10 | AC | 195 ms
24,824 KB |
testcase_11 | AC | 171 ms
24,952 KB |
testcase_12 | AC | 170 ms
25,208 KB |
testcase_13 | AC | 196 ms
24,824 KB |
testcase_14 | AC | 170 ms
25,532 KB |
testcase_15 | AC | 168 ms
24,824 KB |
testcase_16 | AC | 171 ms
24,952 KB |
testcase_17 | AC | 170 ms
25,208 KB |
testcase_18 | AC | 172 ms
24,824 KB |
testcase_19 | AC | 196 ms
25,208 KB |
testcase_20 | AC | 169 ms
25,208 KB |
testcase_21 | AC | 170 ms
25,064 KB |
testcase_22 | AC | 169 ms
25,064 KB |
testcase_23 | AC | 181 ms
24,440 KB |
testcase_24 | AC | 179 ms
24,568 KB |
testcase_25 | AC | 226 ms
25,208 KB |
testcase_26 | AC | 194 ms
25,208 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 170 ms
25,208 KB |
testcase_38 | AC | 169 ms
24,952 KB |
testcase_39 | AC | 169 ms
24,568 KB |
testcase_40 | AC | 179 ms
25,208 KB |
testcase_41 | AC | 196 ms
24,568 KB |
testcase_42 | AC | 170 ms
24,568 KB |
testcase_43 | AC | 168 ms
25,208 KB |
testcase_44 | AC | 168 ms
24,824 KB |
testcase_45 | WA | - |
testcase_46 | AC | 168 ms
24,964 KB |
testcase_47 | AC | 194 ms
24,836 KB |
testcase_48 | AC | 167 ms
24,580 KB |
testcase_49 | AC | 170 ms
24,964 KB |
testcase_50 | AC | 169 ms
25,220 KB |
testcase_51 | AC | 168 ms
25,472 KB |
testcase_52 | AC | 167 ms
25,220 KB |
testcase_53 | AC | 179 ms
25,220 KB |
testcase_54 | AC | 170 ms
25,220 KB |
testcase_55 | AC | 168 ms
24,836 KB |
testcase_56 | AC | 170 ms
24,836 KB |
ソースコード
#include "bits/stdc++.h" #include <stdio.h> #include <math.h> #include "atcoder/all" #include <float.h> //#include <boost/multiprecision/cpp_int.hpp> //using namespace boost::multiprecision; using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) #define TCASE() ll _ttt; cin >> _ttt; while(_ttt--) using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; #define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x; #define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x; #define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init); using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template <class T = long long> using pql = priority_queue<T>; template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>; using vm = vector<mint>; using vvm = vector<vm>; ostream& operator<<(ostream& os, const mint& v) { os << v.val(); return os; } void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; }; template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 auto gmax(const auto& a, const auto& b) { return a > b ? a : b; }; auto gmin(const auto& a, const auto& b) { return a < b ? a : b; }; bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; } bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; } void sort(auto& v) { std::ranges::sort(v); }; void rev(auto& v) { std::ranges::reverse(v); }; template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; }; template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); } long long ceil(const long long a, const long long b) { return (a + b - 1) / b; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n, q; cin >> n >> q; vl bi; vl si; REP(i, n / 2) { cout << "? " << i*2 + 1 << " " << i * 2 + 2 << " " << i * 2 +2 << " " << i * 2 +2 << endl; ll x; cin >> x; if (x == 0) { bi.push_back(i * 2); si.push_back(i * 2 + 1); } else { bi.push_back(i * 2 + 1); si.push_back(i * 2); } } ll tbi = bi[0]; ll tsi = si[0]; REP(i, n / 2 - 1) { ll x; cout << "? " << tbi + 1 << " " << tbi + 2 << " " << bi[i + 1] + 1 << " " << bi[i + 1] + 1<< endl; cin >> x; if (x == 1) tbi = bi[i + 1]; } REP(i, n / 2 - 1) { ll x; cout << "? " << tsi + 1 << " " << tsi + 2 << " " << si[i + 1] + 1 << " " << si[i + 1] + 1 << endl; cin >> x; if (x == 0) tsi = si[i + 1]; } cout << "! " << tsi + 1 << " " << tsi + 1 << " " << tbi + 1 << " " << n << endl; }