제출 #371211

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371211		ja_kingy	Circus (Balkan15_CIRCUS)	C++14	11 / 100	39 ms	3048 KiB

circus

#include "circus.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
vector<pii> mnstk;
vector<int> _P;
int N, M;

void init(int _N, int _M, int P[]){
    N = _N;
    M = _M;
    _P.insert(_P.end(), P, P+N);
}

int minLength(int D) {
    vector<int> P = _P;
    P.push_back(D);
    sort(P.begin(), P.end());
    priority_queue<pii> pq;
    mnstk.push_back({M,M});
    for (int i = N+1; i-->0;) {
        while (pq.size() && pq.top().first >= P[i]) {
            if (pq.top().second < mnstk.back().second) {
                mnstk.push_back(pq.top());
            }
            pq.pop();
        }
        pq.push({2*P[i] - mnstk.back().second, P[i]});
        if (P[i] == D) {
            return mnstk.back().second - P[i];
        }
    }
}

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

circus.cpp: In function 'int minLength(int)':
circus.cpp:16:21: warning: control reaches end of non-void function [-Wreturn-type]
   16 |     vector<int> P = _P;
      |                     ^~
grader.cpp: In function 'int main()':
grader.cpp:14:12: warning: unused variable 'max_code' [-Wunused-variable]
   14 |  long long max_code;
      |            ^~~~~~~~
grader.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
grader.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |   scanf("%d", &P[i]);
      |   ~~~~~^~~~~~~~~~~~~
grader.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
grader.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |   scanf("%d", &d);
      |   ~~~~~^~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 23
• Subtask 4: 0 / 9
• Subtask 5: 0 / 31
• Subtask 6: 0 / 9