제출 #348616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348616		beksultan04	코끼리 (Dancing Elephants) (IOI11_elephants)	C++14	26 / 100	9092 ms	1932 KiB

elephants

#include "elephants.h"
#ifndef EVAL
#include "grader.cpp"
#endif // EVAL

#include <bits/stdc++.h>
#pragma optimize("Ofast,unroll_loops")
#pragma target("avx,avx2,fma")
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin()Ñ,s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int NN = 3e5+12,INF=1e9+7;

int n,q[NN],dlina;
set <int> s;
void init(int N, int L, int X[]){
    n = N;
    dlina = L;
    for (int i=0;i<n;++i)s.insert(X[i]),q[i]=X[i];

}

int update(int i, int y){
    s.erase(q[i]);
    q[i] = y;
    s.insert(q[i]);
    int ans=1;
    int l = *s.begin();
    for (auto a: s){
        if (l+dlina < a){
            ans++;
            l = a;
        }
    }

    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

elephants.cpp:7: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
    7 | #pragma optimize("Ofast,unroll_loops")
      | 
elephants.cpp:8: warning: ignoring #pragma target  [-Wunknown-pragmas]
    8 | #pragma target("avx,avx2,fma")
      |

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