/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 536.0 KiB
#2 Accepted 3ms 316.0 KiB

Code

//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;
void s()
{
    int n;
    cin >> n;
    map<int,int>mp;

    for(int i=0;i<n;i++) {
        int x;
        cin >> x;
        mp[x]++;
    }

    for(int i=1;i<=n;i++) {
        if(mp[i]!=1) {
            cout << "NO" << endl;
            return;
        }
    }

    cout << "YES" << endl;
}
int32_t main()
{   ios::sync_with_stdio(false);

    TC
    s();


}




Information

Submit By
Type
Submission
Problem
P1055 Array Permutation
Contest
Brain Booster #3
Language
C++17 (G++ 13.2.0)
Submit At
2024-05-06 15:03:25
Judged At
2024-10-03 13:53:09
Judged By
Score
100
Total Time
3ms
Peak Memory
536.0 KiB