結果
| 問題 | No.1306 Exactly 2 Digits |
| ユーザー |
 harady_a_human
|
| 提出日時 | 2020-11-24 00:44:35 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 12,741 bytes |
| コンパイル時間 | 2,934 ms |
| コンパイル使用メモリ | 210,988 KB |
| 実行使用メモリ | 25,580 KB |
| 平均クエリ数 | 2.20 |
| 最終ジャッジ日時 | 2024-07-17 07:33:37 |
| 合計ジャッジ時間 | 26,158 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | WA | - |
| testcase_17 | RE | - |
| testcase_18 | WA | - |
| testcase_19 | RE | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | RE | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| 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 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
| testcase_45 | WA | - |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | WA | - |
| testcase_50 | WA | - |
| testcase_51 | WA | - |
| testcase_52 | WA | - |
| testcase_53 | WA | - |
| testcase_54 | WA | - |
| testcase_55 | WA | - |
| testcase_56 | WA | - |
| testcase_57 | WA | - |
| testcase_58 | WA | - |
| testcase_59 | WA | - |
| testcase_60 | WA | - |
| testcase_61 | WA | - |
| testcase_62 | WA | - |
| testcase_63 | WA | - |
| testcase_64 | WA | - |
| testcase_65 | WA | - |
| testcase_66 | WA | - |
| testcase_67 | WA | - |
| testcase_68 | WA | - |
| testcase_69 | WA | - |
| testcase_70 | WA | - |
| testcase_71 | WA | - |
| testcase_72 | WA | - |
| testcase_73 | WA | - |
| testcase_74 | WA | - |
| testcase_75 | WA | - |
| testcase_76 | WA | - |
| testcase_77 | WA | - |
| testcase_78 | WA | - |
| testcase_79 | WA | - |
| testcase_80 | WA | - |
| testcase_81 | WA | - |
| testcase_82 | WA | - |
| testcase_83 | WA | - |
| testcase_84 | WA | - |
| testcase_85 | WA | - |
| testcase_86 | WA | - |
| testcase_87 | WA | - |
| testcase_88 | WA | - |
| testcase_89 | WA | - |
| testcase_90 | WA | - |
| testcase_91 | WA | - |
| testcase_92 | WA | - |
| testcase_93 | WA | - |
| testcase_94 | WA | - |
| testcase_95 | WA | - |
| testcase_96 | WA | - |
| testcase_97 | WA | - |
| testcase_98 | WA | - |
| testcase_99 | WA | - |
| testcase_100 | WA | - |
| testcase_101 | WA | - |
| testcase_102 | WA | - |
| testcase_103 | WA | - |
| testcase_104 | WA | - |
| testcase_105 | WA | - |
| testcase_106 | WA | - |
| testcase_107 | WA | - |
| testcase_108 | WA | - |
| testcase_109 | WA | - |
| testcase_110 | WA | - |
| testcase_111 | WA | - |
| testcase_112 | WA | - |
| testcase_113 | WA | - |
| testcase_114 | WA | - |
| testcase_115 | WA | - |
| testcase_116 | WA | - |
| testcase_117 | WA | - |
| testcase_118 | WA | - |
| testcase_119 | WA | - |
| testcase_120 | WA | - |
| testcase_121 | WA | - |
| testcase_122 | WA | - |
ソースコード
#include <bits/stdc++.h>
// #include <iostream> // cout, endl, cin
// #include <string> // string, to_string, stoi
// #include <vector> // vector
// #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
// #include <utility> // pair, make_pair
// #include <tuple> // tuple, make_tuple
// #include <cstdint> // int64_t, int*_t
// #include <cstdio> // printf
// #include <map> // map
// #include <queue> // queue, priority_queue
// #include <set> // set
// #include <stack> // stack
// #include <deque> // deque
// #include <unordered_map> // unordered_map
// #include <unordered_set> // unordered_set
// #include <bitset> // bitset
// #include <climits>
// #include <cmath>
// #include <iomanip>
// #include <functional>
// #include <numeric>
// #include <random>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
// #define F first
// #define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(int)(b);(i)++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int (i)=(a);(i)>=(int)(b);(i)--)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
#define UNIQUE(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define Double double
// #define endl '\n'
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using ll = long long;
using ld = long double;
using UnWeightedGraph = vector<vector<int>>;
ll INF = LLONG_MAX / 4 - 100;
int IINF = INT_MAX / 4;
ll mod = 1e9 + 7;
int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};
vector<ll> prime;
long double pi = 3.141592653589793238;
class fact {
public:
long long fmod = 1e9+7;
vector<long long> fac, finv, inv;
fact (int n, long long Mod = 1e9+7) {
fmod = Mod;
fac = vector<long long>(n + 1, 0);
finv = vector<long long>(n + 1, 0);
inv = vector<long long>(n + 1, 0);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < n + 1; i++) {
fac[i] = fac[i-1] * i % fmod;
inv[i] = mod - inv[mod%i] * (mod/i) % mod;
finv[i] = finv[i-1] * inv[i] % mod;
}
}
ll nCr(ll n, ll r) {if(n < r) return 0; return fac[n] * finv[r] % fmod * finv[n-r] % fmod;}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%fmod;}a = a * a%fmod; b >>= 1;}return c;}
inline int operator [] (int i) {return fac[i];}
ll DeBuG(ll n, ll r);
};
void DEBUG(vector<int> a) {for(int i=0;i<a.size();i++)cout<<a[i]<<" ";cout<<endl;}
void EMP(int x) {cout<<"!!!"<<x<<"!!!"<<endl;}
ll GCD(ll a, ll b) {ll c; while (b != 0) {c = a % b; a = b; b = c;}return a;}
ll LCM(ll a, ll b) {return (a / GCD(a, b)) * (b / GCD(a, b)) * GCD(a, b);}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%mod;}a = a * a%mod; b >>= 1;}return c;}
ld POW(ld a, ll b) {ld c = 1; while (b > 0) {if (b & 1) {c = a * c;}a = a * a; b >>= 1;}return c;}
void PRI(ll n) {bool a[n + 1]; for (int i = 0; i < n + 1; i++) {a[i] = 1;}for (int i = 2; i < n + 1; i++) {if (a[i]) {prime.pb(i); ll b = i; while (b <= n) {a[b] = 0; b += i;}}}}
template <typename T> T chmin(T& a, T b) {if(a>b)a=b;return a;}
template <typename T> T chmax(T& a, T b) {if(a<b)a=b;return b;}
bool isSqrt(ll a) {return pow(sqrt(a),2) == a ? 1 : 0;}
void YesNo(bool a) {if (a) cout << "Yes"; else cout << "No"; cout << endl;}
void yesno(bool a) {if (a) cout << "yes"; else cout << "no"; cout << endl;}
void YESNO(bool a) {if (a) cout << "YES"; else cout << "NO"; cout << endl;}
double dis(int x1, int x2, int y1, int y2) {
return sqrt((double)abs(x1-x2)*(double)abs(x1-x2)+(double)abs(y1-y2)*(double)abs(y1-y2));
}
int ceili(int x, int y) {
if (x % y == 0) return x / y;
else return x / y + 1;
}
unsigned int randxor() {
static unsigned int x=123456789,y=362436069,z=521288629,w=88675123;
unsigned int t;
t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) );
}
uint64_t xor64(void) {
static uint64_t x = 88172645463325252ULL;
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a%b, y, x);
y -= a/b * x;
return d;
}
int invs(vector<int> &vec) {
vector<pair<int, int>> val(vec.size());
vector<int> bit(vec.size()+1);
for (int i = 0; i < vec.size(); i++) {
val[i] = {vec[i], i+1};
}
sort(val.rbegin(), val.rend());
int ret = 0;
for (int i = 0; i < val.size(); i++) {
for (int j = val[i].second; j > 0; j -= j & -j) ret += bit[j];
for (int j = val[i].second; j <= vec.size(); j += j & -j) bit[j]++;
}
return ret;
}
void AND(int i, int j) {
cout << "AND " << i << " " << j << endl;
}
void OR(int i, int j) {
cout << "OR " << i << " " << j << endl;
}
void XOR(int i, int j) {
cout << "XOR " << i << " " << j << endl;
}
int co(int n, int i, int j) {
return (n*i+j);
}
pair<int, int> req(int i, int j) {
cout << "? " << i << " " << j << endl;
int t1, t2; cin >> t1 >> t2; return {t1, t2};
}
void solve() {
int n; cin >> n;
if (n != 4) exit(0);
if (n == 2) {
auto res = req(1, 2);
if (res.first == -1) {
cout << "! " << 2 << " " << 3 << endl;
} else {
cout << "! " << 3 << " " << 2 << endl;
}
return;
}
map<int, int> cnt;
map<pair<int, int>, vector<int>> idx;
vector<pair<int, int>> res(n*n-n);
vector<int> ans(n*n-n, -1);
// cout << 1 << endl;
rep (_, n*n-n-1) {
res[_+1] = req(_+2, 1);
cnt[res[_+1].first]++, cnt[res[_+1].second]++;
idx[{res[_+1]}].pb(_+1);
}
map<int, int> posi;
// cout << 1 << endl;
for (auto e : cnt) if (e.first > 0) posi[e.second]++;
if (posi.size() == 0) {
cout << 1 << endl;
vector<int> dgs({n-1, n-1});
// DEBUG(dgs);
ans[0] = co(n, dgs[0], dgs[1]);
int minp = idx[minmax(-dgs[0]+1, -dgs[1])][0];
ans[minp] = n;
rep (i, n*n-n) {
if (ans[i] != -1) continue;
// cout << i << endl;
if (res[i].first == res[i].second) ans[i] = co(n, dgs[0]+res[i].first, dgs[1]+res[i].first);
else {
set<int> c1{co(n, n-1+res[i].first, n-1+res[i].second),
co(n, n-1+res[i].second, n-1+res[i].first)};
for (auto e : c1) if (e > n*n-1) c1.erase(e);
if (c1.size() == 1) {
ans[i] = *c1.begin();
continue;
}
pair<int, int> tmp = req(i+1, minp+1);
set<int> c2{co(n, 1+tmp.first, tmp.second), co(n, 1+tmp.second, tmp.first)};
for (auto e : c1) {
for (auto e2 : c2) {
// cout << e << " " << e2 << endl;
if (e == e2) ans[i] = e;
}
}
c1.erase(ans[i]);
for (auto e : idx[res[i]]) if (ans[e] == -1) ans[e] = *c1.begin();
}
}
} /*else if (posi.size() == 1) {
ans[0] = co(n, n-1-posi.begin()->second, n-1-posi.begin()->second);
vector<int> dgs({n-1-posi.begin()->second, n-1-posi.begin()->second});
int minp = idx[{-(n-1-posi.begin()->second), -(n-1-posi.begin()->second)+1}][0];
ans[minp] = n;
rep (i, n*n-n) {
if (ans[i] != -1) continue;
if (res[i].first == res[i].second) ans[i] = co (n, dgs[0]+res[i].first, dgs[1]+res[i].first);
else {
set<int> c1{co(n, dgs[0]+res[i].first, dgs[1]+res[i].second),
co(n, dgs[0]+res[i].second, dgs[1]+res[i].first)};
pair<int, int> tmp = req(i+1, minp+1);
set<int> c2{co(n, 1+tmp.first, tmp.second), co(n, 1+tmp.second, tmp.first)};
for (auto e : c1) {
for (auto e2 : c2) {
// cout << e << " " << e2 << endl;
if (e == e2) ans[i] = e;
}
}
c1.erase(ans[i]);
for (auto e : idx[res[i]]) if (ans[e] == -1) ans[e] = *c1.begin();
}
}
} */else if (posi.begin()->first == n) {
cout << 2 << endl;
vector<int> dgs({n-1-(posi.size()!=1)*posi.rbegin()->second-posi.begin()->second, n-1-(posi.size()!=1)*posi.rbegin()->second});
// DEBUG(dgs);
ans[0] = co(n, dgs[0], dgs[1]);
int minp = idx[minmax(-dgs[0]+1, -dgs[1])][0];
cout << ans[0] << " " << minp << endl;
ans[minp] = n;
rep (i, n*n-n) {
if (ans[i] != -1) continue;
if (res[i].first == res[i].second) ans[i] = co (n, dgs[0]+res[i].first, dgs[1]+res[i].first);
else {
set<int> c1{co(n, dgs[0]+res[i].first, dgs[1]+res[i].second),
co(n, dgs[0]+res[i].second, dgs[1]+res[i].first)};
for (auto e : c1) if (e > n*n-1) c1.erase(e);
if (c1.size() == 1) {
ans[i] = *c1.begin();
continue;
}
pair<int, int> tmp = req(i+1, minp+1);
set<int> c2{co(n, 1+tmp.first, tmp.second), co(n, 1+tmp.second, tmp.first)};
for (auto e : c1) {
for (auto e2 : c2) {
// cout << e << " " << e2 << endl;
if (e == e2) ans[i] = e;
}
}
c1.erase(ans[i]);
for (auto e : idx[res[i]]) if (ans[e] == -1) ans[e] = *c1.begin();
}
}
} else if (posi.begin()->first == n-1) {
cout << 3 << endl;
vector<int> dgs({n-1-(posi.size()!=1)*posi.rbegin()->second, n-1-(posi.size()!=1)*posi.rbegin()->second-posi.begin()->second});
ans[0] = co(n, dgs[0], dgs[1]);
int maxp = idx[minmax(n-1-dgs[0], n-1-dgs[1])][0];
ans[maxp] = n*n-1;
rep (i, n*n-n) {
if (ans[i] != -1) continue;
if (res[i].first == res[i].second) ans[i] = co (n, dgs[0]+res[i].first, dgs[1]+res[i].first);
else {
set<int> c1{co(n, dgs[0]+res[i].first, dgs[1]+res[i].second),
co(n, dgs[0]+res[i].second, dgs[1]+res[i].first)};
for (auto e : c1) if (e > n*n-1) c1.erase(e);
if (c1.size() == 1) {
ans[i] = *c1.begin();
continue;
}
pair<int, int> tmp = req(maxp+1, i+1);
set<int> c2{co(n, n-1-tmp.first, n-1-tmp.second), co(n, n-1-tmp.second, n-1-tmp.first)};
for (auto e : c1) {
for (auto e2 : c2) {
// cout << e << " " << e2 << endl;
if (e == e2) ans[i] = e;
}
}
c1.erase(ans[i]);
for (auto e : idx[res[i]]) if (ans[e] == -1) ans[e] = *c1.begin();
}
}
} else {
cout << 4 << endl;
ans[0] = co(n, n-1-posi.begin()->second, n-1-posi.begin()->second);
vector<int> dgs({n-1-posi.begin()->second, n-1-posi.begin()->second});
int minp = idx[minmax(-(n-1-posi.begin()->second), -(n-1-posi.begin()->second)+1)][0];
ans[minp] = n;
rep (i, n*n-n) {
if (ans[i] != -1) continue;
if (res[i].first == res[i].second) ans[i] = co (n, dgs[0]+res[i].first, dgs[1]+res[i].first);
else {
set<int> c1{co(n, dgs[0]+res[i].first, dgs[1]+res[i].second),
co(n, dgs[0]+res[i].second, dgs[1]+res[i].first)};
for (auto e : c1) if (e > n*n-1) c1.erase(e);
if (c1.size() == 1) {
ans[i] = *c1.begin();
continue;
}
pair<int, int> tmp = req(i+1, minp+1);
set<int> c2{co(n, 1+tmp.first, tmp.second), co(n, 1+tmp.second, tmp.first)};
for (auto e : c1) {
for (auto e2 : c2) {
// cout << e << " " << e2 << endl;
if (e == e2) ans[i] = e;
}
}
c1.erase(ans[i]);
for (auto e : idx[res[i]]) if (ans[e] == -1) ans[e] = *c1.begin();
}
}
}
cout << "! ";
DEBUG(ans);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}