#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int>pi;
typedef pair<ll, ll>pl;
typedef vector<pi>vpi;
typedef vector<pl>vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<bool> vb;
const long double PI = acos(-1);
const ll oo = 1e18;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
#define endl '\n'
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define read(v) for (auto& it : v) scanf("%d", &it);
#define readL(v) for (auto& it : v) scanf("%lld", &it);
#define print(v) for (auto it : v) printf("%d ", it); puts("");
#define printL(v) for (auto it : v) printf("%lld ", it); puts("");
void solve() {
int n;
cin >> n;
vi v(n);
for (auto& it : v)
cin >> it;
int ans = 0;
vb vis(n, false);
for (int i = 0; i < n; i++) {
if (vis[i])
continue;
int h = v[i] - 1;
for (int j = 0; j < n; j++)
if (j != i && !vis[j] && v[j] == h)
h--, vis[j] = true, j = 0;
vis[i] = true, ans++;
}
cout << ans << endl;
}
int t = 1;
int main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
//#endif
//scanf("%d", &t);
while (t--) solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
| 2 |
Incorrect |
5 ms |
212 KB |
Output isn't correct |
| 3 |
Incorrect |
15 ms |
312 KB |
Output isn't correct |
| 4 |
Incorrect |
21 ms |
320 KB |
Output isn't correct |
| 5 |
Execution timed out |
2063 ms |
3388 KB |
Time limit exceeded |
| 6 |
Execution timed out |
2088 ms |
3760 KB |
Time limit exceeded |
| 7 |
Execution timed out |
2081 ms |
3276 KB |
Time limit exceeded |
| 8 |
Execution timed out |
2081 ms |
3132 KB |
Time limit exceeded |
| 9 |
Execution timed out |
2074 ms |
3284 KB |
Time limit exceeded |
| 10 |
Execution timed out |
2048 ms |
3392 KB |
Time limit exceeded |
