結果

問題 No.2496 LCM between Permutations
ユーザー bortik
提出日時 2023-10-06 23:42:21
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 123 ms / 2,000 ms
コード長 3,274 bytes
コンパイル時間 1,941 ms
コンパイル使用メモリ 200,128 KB
最終ジャッジ日時 2025-02-17 05:44:40
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void solve()’:
main.cpp:36:16: warning: ‘p’ may be used uninitialized [-Wmaybe-uninitialized]
   36 |         if(cur % p == 0 && prev % p != 0){
      |            ~~~~^~~
main.cpp:23:9: note: ‘p’ was declared here
   23 |     int p;
      |         ^
main.cpp:45:5: warning: ‘iA’ may be used uninitialized [-Wmaybe-uninitialized]
   45 |     if(iA != 0){
      |     ^~
main.cpp:32:9: note: ‘iA’ was declared here
   32 |     int iA, iB = 0;
      |         ^~

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)
bool isprime(int num){
    if(num < 2) return false;
    for(int i = 2; i <= int(sqrt(num)); i++){
        if( num % i == 0) return false;
    }
    return true;
}
void solve(){
    int n; cin >> n;
    if(n == 1){
        cout << "! 1 1" << endl;
        return;
    }
    int p;
    rrep(i, n, 1){
        if(isprime(i)){
            p = i;
            break;
        }
    }
    int prev = 1;
    int s = 1;
    int iA, iB = 0;
    rep(i,1,n+1){
        cout << "? " << i << " " << 1 << endl;
        int cur; cin >> cur;
        if(cur % p == 0 && prev % p != 0){
            iA = i;
        } else if(prev % p == 0 && cur % p == 0){
            iB = 1;
            iA = 0;
        }
        prev = cur;
    }
    vector<int> A(n+1, 0), B(n+1, 0);
    if(iA != 0){
        int c = 0;
        A[iA] = p;
        rep(i,1,n+1){
            cout << "? " << iA << " " << i << endl;
            int cur; cin >> cur;
            B[i] = cur / p;
            if(cur == p){
                if(c == 0){
                    cout << "? " << (iA)%n + 1 << " " << i << endl;
                    cin >> cur;
                    if(cur % p == 0){
                        c = 1;
                        B[i] = p;
                        iB = i;
                    } else {
                        c = 2;
                    }
                } else if(c == 2){
                    B[i] = p;
                    iB = i;
                    c = 1;
                }
                
            }
        }
        rep(i,1,iA){
            cout << "? " << i << " " << iB << endl;
            int cur; cin >> cur;
            A[i] = cur / p;
        }
        rep(i,iA+1,n+1){
            cout << "? " << i << " " << iB << endl;
            int cur; cin >> cur;
            A[i] = cur / p;
        }
    } else {
        int c = 0;
        B[iB] = p;
        rep(i,1,n+1){
            cout << "? " << i << " " << iB << endl;
            int cur; cin >> cur;
            A[i] = cur / p;
            if(cur == p){
                if(c == 0){
                    cout << "? " << i << " " << (iB)%n + 1 << endl;
                    cin >> cur;
                    if(cur % p == 0){
                        c = 1;
                        A[i] = p;
                        iA = i;
                    } else {
                        c = 2;
                    }
                } else if(c == 2){
                    A[i] = p;
                    iA = i;
                    c = 1;
                }
                
            }
        }
        rep(i,1,iB){
            cout << "? " << iA << " " << i << endl;
            int cur; cin >> cur;
            B[i] = cur / p;
        }
        rep(i,iB+1,n+1){
            cout << "? " << iA << " " << i << endl;
            int cur; cin >> cur;
            B[i] = cur / p;
        }
    }
    cout << "! ";
    rep(i, 1, n+1) cout << A[i] << " ";
    rep(i, 1, n+1) cout << B[i] << " ";
    cout << endl;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    rep(i,0,t) solve();
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0