#976133 (C++17) No.2745 String Swap Battle

• 問題: No.2745 String Swap Battle
• ユーザー: 0214sh7
• 提出日時: 2024-04-21 05:29:20
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 1,916 bytes
• コンパイル時間: 1,919 ms
• コンパイル使用メモリ: 203,952 KB
• 最終ジャッジ日時: 2025-02-21 07:52:51
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 16 WA * 2

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false
int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    vector<string> S(N);
    REP(i,N){
        cin >> S[i];
    }
    
    auto T = S;
    
    REP(i,N){
        string s = S[i];
        auto ss = s;sort(ALL(ss));
        if(ss==s){
            swap(s[s.size()-1],s[s.size()-2]);
            T[i] = s;
            continue;
        }
        
        vector<ll> B(26,0);REP(j,s.size()){B[s[j]-'a']++;}
        
        ll now = 0;
        while(B[now]==0)now++;
        REP(j,s.size()){
            if(s[j]!='a'+now){
                RREP(k,s.size()){
                    if(s[k]=='a'+now){
                        swap(s[j],s[k]);
                        break;
                    }
                }
                break;
            }
            B[now]--;while(B[now]==0)now++;
        }
        
        T[i] = s;
    }
    
    // REP(i,N){
    //     cout << T[i] << endl;
    // }
    
    string m = T[0];
    REP(j,N){
        m = min(m,T[j]);
    }
    
    ll num = 0;
    REP(j,N){
        if(T[j]==m)num++;
    }
    
    REP(j,N){
        if(T[j]==m){
            cout << N+1-num << endl;
        }else{
            cout << 0 << endl;
        }
    }
    
    return 0;
    
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX