Submission #289269

#	Time	Username	Problem	Language	Result	Execution time	Memory
289269		shashwatchandra	Exercise Deadlines (CCO20_day1problem2)	C++17	0 / 25	1 ms	384 KiB

Main

/*input
3
1 1 3
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)

#define all(v) v.begin(),v.end()
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

void solve(){
  	int n;
  	cin >> n;
  	vector<int> a(n+1,0);
  	RE(i,n){
  		cin >> a[i];
  	}
  	sort(all(a));
  	RE(i,n){
  		if(a[i] < i){
  			cout << -1;
  			return;
  		}
  	}
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 8