QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#603470#9353. Interesting PermutationSatonCompile Error//C++202.5kb2024-10-01 16:47:172024-10-01 16:47:17

Judging History

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

  • [2024-10-01 16:47:17]
  • 评测
  • [2024-10-01 16:47:17]
  • 提交

answer

///by Saton.
#include<bits/stdc++.h>
#define PI acos(-1)
#define fi first
#define se second 
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define LL long long
#define ll __int128
#define DD double double
#define LD long double
#define rep(i,a,b) for(LL i = (a);i <= (b);i ++)
#define lep(i,a,b) for(LL i = (a);i >= (b);i --)
#define FLUSH fflush(stdout)
using namespace std;
const int N = 2e5 + 10,mod =  1e9+7,P = 131;
const LL inf = 1e9+10,INF = 1e18+10;
typedef pair<int,int> PII;
typedef pair<LL,int> PLI;
typedef pair<LL,LL> PLL;
LL n,m,k;

void solve() {
    cin >> n;
    vector<LL> a(n+1);
    rep(i,1,n) cin >> a[i];
    
    if(a[1]!=0 || a[n]!=n-1) {
        cout << 0 << '\n';
        return;
    }
    rep(i,1,n-1) if(a[i]>n-1 || a[i]>a[i+1]) {
        cout << 0 << '\n';
        return;
    }
    
    LL ans = 1;
    rep(i,1,n-1) if(a[i]!=a[i+1]) ans = ans*2%mod;
    
    cout << ans << '\n';
    
} 

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while(T --) { 
        solve();
    }
    // solve();
       
    return 0;
}  
/*   /\_/\
*   (= ._.)
*   / >  \>
*////by Saton.
#include<bits/stdc++.h>
#define PI acos(-1)
#define fi first
#define se second 
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define LL long long
#define ll __int128
#define DD double double
#define LD long double
#define rep(i,a,b) for(LL i = (a);i <= (b);i ++)
#define lep(i,a,b) for(LL i = (a);i >= (b);i --)
#define FLUSH fflush(stdout)
using namespace std;
const int N = 2e5 + 10,mod =  1e9+7,P = 131;
const LL inf = 1e9+10,INF = 1e18+10;
typedef pair<int,int> PII;
typedef pair<LL,int> PLI;
typedef pair<LL,LL> PLL;
LL n,m,k;

void solve() {
    cin >> n;
    vector<LL> a(n+1);
    rep(i,1,n) cin >> a[i];
    
    if(a[1]!=0 || a[n]!=n-1) {
        cout << 0 << '\n';
        return;
    }
    rep(i,1,n-1) if(a[i]>n-1 || a[i]>a[i+1]) {
        cout << 0 << '\n';
        return;
    }
    
    LL ans = 1;
    map<int,int> cnt;
    rep(i,1,n-1) {
        if(i!=1) cnt[a[i]] ++;
        if(a[i]!=a[i+1]) ans = ans*2%mod;
    }
    for(auto [u,v] : cnt) if(u<v) {
        cout << 0 << '\n';
        return;
    }
    cout << ans << '\n';
    
} 

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while(T --) { 
        solve();
    }
    // solve();
       
    return 0;
}  
/*   /\_/\
*   (= ._.)
*   / >  \>
*/

Details

answer.code:73:11: error: redefinition of ‘const int N’
   73 | const int N = 2e5 + 10,mod =  1e9+7,P = 131;
      |           ^
answer.code:16:11: note: ‘const int N’ previously defined here
   16 | const int N = 2e5 + 10,mod =  1e9+7,P = 131;
      |           ^
answer.code:73:24: error: redefinition of ‘const int mod’
   73 | const int N = 2e5 + 10,mod =  1e9+7,P = 131;
      |                        ^~~
answer.code:16:24: note: ‘const int mod’ previously defined here
   16 | const int N = 2e5 + 10,mod =  1e9+7,P = 131;
      |                        ^~~
answer.code:73:37: error: redefinition of ‘const int P’
   73 | const int N = 2e5 + 10,mod =  1e9+7,P = 131;
      |                                     ^
answer.code:16:37: note: ‘const int P’ previously defined here
   16 | const int N = 2e5 + 10,mod =  1e9+7,P = 131;
      |                                     ^
answer.code:74:10: error: redefinition of ‘const long long int inf’
   74 | const LL inf = 1e9+10,INF = 1e18+10;
      |          ^~~
answer.code:17:10: note: ‘const long long int inf’ previously defined here
   17 | const LL inf = 1e9+10,INF = 1e18+10;
      |          ^~~
answer.code:74:23: error: redefinition of ‘const long long int INF’
   74 | const LL inf = 1e9+10,INF = 1e18+10;
      |                       ^~~
answer.code:17:23: note: ‘const long long int INF’ previously defined here
   17 | const LL inf = 1e9+10,INF = 1e18+10;
      |                       ^~~
answer.code:78:4: error: redefinition of ‘long long int n’
   78 | LL n,m,k;
      |    ^
answer.code:21:4: note: ‘long long int n’ previously declared here
   21 | LL n,m,k;
      |    ^
answer.code:78:6: error: redefinition of ‘long long int m’
   78 | LL n,m,k;
      |      ^
answer.code:21:6: note: ‘long long int m’ previously declared here
   21 | LL n,m,k;
      |      ^
answer.code:78:8: error: redefinition of ‘long long int k’
   78 | LL n,m,k;
      |        ^
answer.code:21:8: note: ‘long long int k’ previously declared here
   21 | LL n,m,k;
      |        ^
answer.code:80:6: error: redefinition of ‘void solve()’
   80 | void solve() {
      |      ^~~~~
answer.code:23:6: note: ‘void solve()’ previously defined here
   23 | void solve() {
      |      ^~~~~
answer.code:108:5: error: redefinition of ‘int main()’
  108 | int main() {
      |     ^~~~
answer.code:44:5: note: ‘int main()’ previously defined here
   44 | int main() {
      |     ^~~~