oj.uz

Submission #407020

# Submission time Handle Problem Language Result Execution time Memory
407020 2021-05-18T11:03:38 Z LptN21 Baloni (COCI15_baloni) C++14
0 / 100
 94 ms 7640 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e9
#define eps 1e-9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = 1e6+7, M=1000+7;
const int MOD = 1e9+7;

int n, m, k, t;

int a[N], prv[N];

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d", &n);
    int ans=0;memset(prv, 0, sizeof prv);
    for(int i=1;i<=n;i++) scanf("%d", &a[i]);
    for(int j, i=n;i>0;i--) {
        j=prv[a[i]-1], ans+=(j==0);
        prv[a[i]]=i, a[i]=j;
    }
    printf("%d", ans);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Compilation message

baloni.cpp: In function 'int main()':
baloni.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
baloni.cpp:29:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     for(int i=1;i<=n;i++) scanf("%d", &a[i]);
      |                           ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4172 KB Output isn't correct
2 Incorrect 4 ms 4172 KB Output isn't correct
3 Incorrect 3 ms 4172 KB Output isn't correct
4 Incorrect 4 ms 4172 KB Output isn't correct
5 Incorrect 94 ms 7220 KB Output isn't correct
6 Incorrect 89 ms 7640 KB Output isn't correct
7 Incorrect 94 ms 6980 KB Output isn't correct
8 Incorrect 74 ms 6968 KB Output isn't correct
9 Incorrect 94 ms 7096 KB Output isn't correct
10 Incorrect 84 ms 7272 KB Output isn't correct