Submission #120000

#	Time	Username	Problem	Language	Result	Execution time	Memory
120000		Osama_Alkhodairy	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9028 ms	1788 KiB

elephants

#include <bits/stdc++.h>
#include "elephants.h"
//~ #include "grader.cpp"
using namespace std;

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

int n, l;
vector <pair <int, int> > a;

void init(int N, int L, int X[]){
    n = N;
    l = L;
    for(int i = 0 ; i < n ; i++){
        a.push_back(make_pair(X[i], i));
    }
}
int update(int i, int y){
    for(int j = 0 ; j < n ; j++){
        if(a[j].second == i){
            a.erase(a.begin() + j);
            break;
        }
    }
    for(int j = 0 ; j < n ; j++){
        if(j == n - 1 || a[j].first > y){
            a.insert(a.begin() + j, make_pair(y, i));
            break;
        }
    }
    int cur = a[0].first;
    int ans = 1;
    for(auto &i : a){
        if(cur + l < i.first){
            cur = i.first;
            ans++;
        }
    }
    return ans;
}

Compilation message (stderr)

elephants.cpp:7:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
elephants.cpp:8:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3