QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#143034	#6668. Trokuti	penguinman^#	100 ✓	16ms	3848kb	C++17	3.5kb	2023-08-20 13:11:43	2024-07-04 01:49:50

Judging History

你现在查看的是最新测评结果

[2024-07-04 01:49:50]
评测

测评结果：100
用时：16ms
内存：3848kb

查看

[2023-08-20 13:11:43]
提交

answer

#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;

#define ln "\n"
#define pb emplace_back
#define mp std::make_pair
#define mtp std::make_tuple
#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define all(a) a.begin(),a.end()

constexpr ll inf = (1ll<<60);
constexpr ll mod = 1e9+7;
constexpr ll mul = 23;

void dec(std::map<ll,ll> &mem, ll el){
    mem[el]--;
    if(mem[el] == 0) mem.erase(el);
}

int main(){
    cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::random_device rnd;
    std::mt19937_64 mt(rnd());
    constexpr ll V = 100;
    vii ans(V+1, vi(V+1));
    {
        vector<vii> mem(6,vii(6,vi(6)));
        REP(i,1,5){
            REP(j,i+1,5){
                REP(k,j+1,5){
                    cout << "? " << i << " " << j << " " << k << endl;
                    cin >> mem[i][j][k];
                }
            }
        }
        ll edge = 10;
        ll ch = 0;
        rep(bit,0,1<<edge){
            ll cnt = 0;
            vii table(6,vi(6));
            REP(i,1,5){
                REP(j,i+1,5){
                    if(bit & (1<<cnt)){
                        table[i][j] = true;
                    }
                    cnt++;
                }
            }
            bool flag = true;
            REP(i,1,5){
                REP(j,i+1,5){
                    REP(k,j+1,5){
                        if(mem[i][j][k] != table[i][j]+table[j][k]+table[i][k]) flag = false;
                    }
                }
            }
            if(flag){
                ch++;
                REP(i,1,6){
                    REP(j,i+1,6){
                        ans[i][j] = ans[j][i] = table[i][j];
                    }
                }
            }
        }
        assert(ch == 1);
    }
    REP(k,6,V){
        vi p(k-1);
        rep(i,0,k-1) p[i] = i+1;
        std::shuffle(all(p), mt);
        ll last = 0;
        rep(i,1,k-1){
            cout << "? " << p[i-1] << " " << p[i] << " " << k << endl;
            ll res; cin >> res;
            res -= ans[p[i-1]][p[i]];
            if(res == 1) continue;
            if(res == 0){
                ans[p[i-1]][k] = ans[k][p[i-1]] = ans[p[i]][k] = ans[k][p[i]] = 0;
            }
            else{
                ans[p[i-1]][k] = ans[k][p[i-1]] = ans[p[i]][k] = ans[k][p[i]] = 1;
            }
            per(j,i-2,last){
                ans[p[j]][k] = ans[k][p[j]] = 1-ans[p[j+1]][k];
            }
            last = i+1;
            i++;
        }
        if(last == k-1) continue;
        if(last == 0){
            cout << "? " << p[0] << " " << p[2] << " " << k << endl;
            ll res; cin >> res;
            res /= 2;
            ans[p[0]][k] = ans[k][p[0]] = res;
            rep(i,1,k-1) ans[p[i]][k] = ans[k][p[i]] = 1-ans[p[i-1]][k];
        }
        else{
            cout << "? " << p[0] << " " << p[k-2] << " " << k << endl;
            ll res; cin >> res;
            res -= ans[p[0]][p[k-2]];
            res -= ans[p[0]][k];
            ans[p[k-2]][k] = ans[k][p[k-2]] = res;
            per(j,k-3,last){
                ans[p[j]][k] = ans[k][p[j]] = 1-ans[p[j+1]][k];
            }
        }
    }
    cout << "!" << endl;
    REP(i,1,V){
        REP(j,1,V) cout << ans[i][j];
        cout << endl;
    }
}

源文件, 语言: C++17

詳細信息

Subtask #1:

score: 100

Accepted

Test #1:

score: 100

Accepted

time: 16ms

memory: 3696kb

input:

output:

result:

points 1.0 points  1.0 correct 2504 queries

Test #2:

score: 100

Accepted

time: 5ms

memory: 3712kb

input:

output:

result:

points 1.0 points  1.0 correct 2504 queries

Test #3:

score: 100

Accepted

time: 5ms

memory: 3824kb

input:

output:

? 1 2 3
? 1 2 4
? 1 2 5
? 1 3 4
? 1 3 5
? 1 4 5
? 2 3 4
? 2 3 5
? 2 4 5
? 3 4 5
? 4 3 6
? 5 1 6
? 4 2 6
? 3 6 7
? 5 2 7
? 4 1 7
? 3 2 8
? 4 7 8
? 5 6 8
? 3 1 8
? 7 5 9
? 4 8 9
? 2 3 9
? 1 6 9
? 8 4 10
? 5 1 10
? 7 6 10
? 2 3 10
? 8 9 10
? 1 9 11
? 8 4 11
? 7 10 11
? 6 5 11
? 2 3 11
? 3 4 12
? 7 5 12...

result:

points 1.0 points  1.0 correct 2504 queries

Test #4:

score: 100

Accepted

time: 0ms

memory: 3708kb

input:

output:

? 1 2 3
? 1 2 4
? 1 2 5
? 1 3 4
? 1 3 5
? 1 4 5
? 2 3 4
? 2 3 5
? 2 4 5
? 3 4 5
? 4 3 6
? 2 1 6
? 4 5 6
? 2 3 7
? 4 6 7
? 5 1 7
? 1 4 8
? 3 7 8
? 2 6 8
? 1 5 8
? 6 4 9
? 8 2 9
? 3 7 9
? 5 1 9
? 4 1 10
? 2 3 10
? 9 6 10
? 5 8 10
? 4 7 10
? 10 8 11
? 6 5 11
? 4 9 11
? 7 2 11
? 3 1 11
? 1 5 12
? 7 10 1...

result:

points 1.0 points  1.0 correct 2505 queries

Test #5:

score: 100

Accepted

time: 2ms

memory: 3664kb

input:

output:

? 1 2 3
? 1 2 4
? 1 2 5
? 1 3 4
? 1 3 5
? 1 4 5
? 2 3 4
? 2 3 5
? 2 4 5
? 3 4 5
? 5 2 6
? 3 1 6
? 5 4 6
? 2 5 7
? 6 4 7
? 3 1 7
? 2 7 8
? 3 5 8
? 6 4 8
? 2 1 8
? 4 1 9
? 5 8 9
? 6 7 9
? 2 3 9
? 7 3 10
? 2 9 10
? 4 6 10
? 5 1 10
? 7 8 10
? 2 3 11
? 7 9 11
? 10 5 11
? 1 8 11
? 4 6 11
? 5 4 12
? 8 9 12...

result:

points 1.0 points  1.0 correct 2510 queries

Test #6:

score: 100

Accepted

time: 0ms

memory: 3588kb

input:

output:

? 1 2 3
? 1 2 4
? 1 2 5
? 1 3 4
? 1 3 5
? 1 4 5
? 2 3 4
? 2 3 5
? 2 4 5
? 3 4 5
? 4 1 6
? 3 2 6
? 4 5 6
? 6 5 7
? 2 1 7
? 4 3 7
? 3 5 8
? 6 4 8
? 7 1 8
? 3 2 8
? 1 2 9
? 8 4 9
? 6 7 9
? 3 5 9
? 8 5 10
? 4 1 10
? 3 6 10
? 7 2 10
? 8 9 10
? 5 2 11
? 3 1 11
? 6 10 11
? 9 4 11
? 7 8 11
? 3 6 12
? 10 2 1...

result:

points 1.0 points  1.0 correct 2510 queries

Test #7:

score: 100

Accepted

time: 0ms

memory: 3548kb

input:

output:

result:

points 1.0 points  1.0 correct 3129 queries

Test #8:

score: 100

Accepted

time: 6ms

memory: 3704kb

input:

output:

result:

points 1.0 points  1.0 correct 3191 queries

Test #9:

score: 100

Accepted

time: 0ms

memory: 3700kb

input:

output:

? 1 2 3
? 1 2 4
? 1 2 5
? 1 3 4
? 1 3 5
? 1 4 5
? 2 3 4
? 2 3 5
? 2 4 5
? 3 4 5
? 3 1 6
? 4 2 6
? 3 5 6
? 2 1 7
? 1 6 7
? 6 5 7
? 5 4 7
? 4 3 7
? 2 6 7
? 4 7 8
? 7 5 8
? 1 2 8
? 2 3 8
? 3 6 8
? 4 6 8
? 6 5 9
? 5 3 9
? 8 4 9
? 4 1 9
? 1 2 9
? 2 7 9
? 6 7 9
? 5 7 10
? 3 1 10
? 2 4 10
? 8 9 10
? 9 6 10...

result:

points 1.0 points  1.0 correct 3294 queries

Test #10:

score: 100

Accepted

time: 9ms

memory: 3588kb

input:

output:

? 1 2 3
? 1 2 4
? 1 2 5
? 1 3 4
? 1 3 5
? 1 4 5
? 2 3 4
? 2 3 5
? 2 4 5
? 3 4 5
? 4 1 6
? 5 3 6
? 4 2 6
? 1 4 7
? 5 6 7
? 3 2 7
? 3 2 8
? 5 4 8
? 7 1 8
? 3 6 8
? 6 3 9
? 5 8 9
? 7 1 9
? 2 4 9
? 2 7 10
? 1 9 10
? 6 8 10
? 4 5 10
? 2 3 10
? 7 8 11
? 5 10 11
? 4 9 11
? 1 3 11
? 2 6 11
? 2 8 12
? 11 9 1...

result:

points 1.0 points  1.0 correct 3007 queries

Test #11:

score: 100

Accepted

time: 7ms

memory: 3708kb

input:

output:

result:

points 1.0 points  1.0 correct 3319 queries

Test #12:

score: 100

Accepted

time: 8ms

memory: 3592kb

input:

output:

result:

points 1.0 points  1.0 correct 3333 queries

Test #13:

score: 100

Accepted

time: 0ms

memory: 3708kb

input:

output:

result:

points 1.0 points  1.0 correct 3346 queries

Test #14:

score: 100

Accepted

time: 3ms

memory: 3848kb

input:

output:

result:

points 1.0 points  1.0 correct 3289 queries

Test #15:

score: 100

Accepted

time: 6ms

memory: 3824kb

input:

output:

result:

points 1.0 points  1.0 correct 3285 queries

Test #16:

score: 100

Accepted

time: 0ms

memory: 3652kb

input:

output:

result:

points 1.0 points  1.0 correct 3322 queries

Test #17:

score: 100

Accepted

time: 7ms

memory: 3848kb

input:

output:

result:

points 1.0 points  1.0 correct 3336 queries

Test #18:

score: 100

Accepted

time: 5ms

memory: 3592kb

input:

output:

result:

points 1.0 points  1.0 correct 3353 queries

Test #19:

score: 100

Accepted

time: 2ms

memory: 3716kb

input:

output:

result:

points 1.0 points  1.0 correct 3315 queries

Test #20:

score: 100

Accepted

time: 0ms

memory: 3816kb

input:

output:

result:

points 1.0 points  1.0 correct 3335 queries