Submission #23407790


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<char>>;


int main(){

  int n;
  cin >> n;
  vector<ll> a(n);
  REP(i,n){
    cin >> a.at(i);
  }

  sort(a.begin(),a.end());

  REP(i,n){
    if(i+1!=a.at(i)){
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  
}

Submission Info

Submission Time
Task B - Permutation Check
User takkey
Language C++ (GCC 9.2.1)
Score 200
Code Size 754 Byte
Status AC
Exec Time 8 ms
Memory 3636 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 14
Set Name Test Cases
Sample example_00.txt, example_01.txt, example_02.txt, example_03.txt
All example_00.txt, example_01.txt, example_02.txt, example_03.txt, handmade_00.txt, handmade_01.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, yes_00.txt, yes_01.txt, yes_02.txt, yes_03.txt
Case Name Status Exec Time Memory
example_00.txt AC 8 ms 3500 KiB
example_01.txt AC 3 ms 3500 KiB
example_02.txt AC 2 ms 3596 KiB
example_03.txt AC 2 ms 3600 KiB
handmade_00.txt AC 3 ms 3612 KiB
handmade_01.txt AC 5 ms 3484 KiB
random_00.txt AC 3 ms 3508 KiB
random_01.txt AC 4 ms 3536 KiB
random_02.txt AC 2 ms 3636 KiB
random_03.txt AC 4 ms 3588 KiB
yes_00.txt AC 2 ms 3432 KiB
yes_01.txt AC 2 ms 3500 KiB
yes_02.txt AC 2 ms 3452 KiB
yes_03.txt AC 2 ms 3584 KiB