結果

問題 No.282 おもりと天秤(2)
ユーザー fumiphysfumiphys
提出日時 2019-10-30 22:57:59
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,621 ms / 5,000 ms
コード長 3,556 bytes
コンパイル時間 1,693 ms
コンパイル使用メモリ 171,208 KB
実行使用メモリ 25,220 KB
平均クエリ数 440.67
最終ジャッジ日時 2024-07-17 02:23:29
合計ジャッジ時間 34,666 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
25,220 KB
testcase_01 AC 41 ms
24,964 KB
testcase_02 AC 28 ms
25,220 KB
testcase_03 AC 27 ms
25,220 KB
testcase_04 AC 26 ms
24,964 KB
testcase_05 AC 33 ms
24,836 KB
testcase_06 AC 47 ms
24,836 KB
testcase_07 AC 25 ms
24,580 KB
testcase_08 AC 48 ms
24,580 KB
testcase_09 AC 24 ms
24,836 KB
testcase_10 AC 953 ms
25,220 KB
testcase_11 AC 3,195 ms
25,208 KB
testcase_12 AC 1,054 ms
24,964 KB
testcase_13 AC 1,620 ms
24,964 KB
testcase_14 AC 2,743 ms
24,836 KB
testcase_15 AC 3,395 ms
25,220 KB
testcase_16 AC 234 ms
25,220 KB
testcase_17 AC 1,477 ms
24,836 KB
testcase_18 AC 2,454 ms
24,916 KB
testcase_19 AC 2,430 ms
24,964 KB
testcase_20 AC 3,621 ms
24,940 KB
testcase_21 AC 3,582 ms
25,196 KB
testcase_22 AC 3,499 ms
24,812 KB
testcase_23 AC 23 ms
24,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<int> v(n);
  rep(i, n)v[i] = i + 1;
  rep(i_, n){
    vector<int> q(2 * n, 0);
    rep(j, n / 2){
      q[2*j] = v[2*j];
      q[2*j+1] = v[2*j+1];
    }
    cout << "? " << q << endl;
    rep(j, n){
      char c; cin >> c;
      if(j < n / 2){
        if(c == '>')swap(v[2*j], v[2*j+1]);
      }
    }
    q.assign(2 * n, 0);
    rep(j, (n - 1) / 2){
      q[2*j] = v[2*j+1];
      q[2*j+1] = v[2*j+2];
    }
    cout << "? " << q << endl;
    rep(j, n){
      char c; cin >> c;
      if(j < (n - 1) / 2){
        if(c == '>')swap(v[2*j+1], v[2*j+2]);
      }
    }
  }
  cout << "! " << v << endl;
  return 0;
}
0