제출 #23055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23055		model_code	Kralj (COCI16_kralj)	C++11	140 / 140	1089 ms	46204 KiB

kralj

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

typedef pair<int, int> P;
#define X first
#define Y second

const int MAX = 500100;

int n;
int on[MAX];
int moji[MAX], poc[MAX];
int pref[MAX];
vector <int> V[MAX];

int rijesi(int prvi)
{
  int ret = 0;
  set <int> S;

  for (int i=prvi, j=0; j<n; j++, i=(i+1) % n) {
    for (auto it : V[i])
      S.insert(it);

    auto it = S.upper_bound(on[i]);
    if (it == S.end())
      S.erase(S.begin());
    else {
      ret++;
      S.erase(it);
    }
  }

  return ret;
}

int main()
{
  scanf("%d", &n);

  memset(pref, -1, sizeof pref);

  for (int i=0; i<n; i++) {
    scanf("%d", &poc[i]);
    poc[i]--;
  }

  for (int i=0; i<n; i++)
    scanf("%d", &on[i]);

  for (int i=0; i<n; i++) {
    scanf("%d", &moji[i]);
    pref[poc[i]]++;
    V[poc[i]].push_back(moji[i]);
  }

  P minn = P(MAX, MAX);
  for (int i=0; i<n; i++) {
    if (i)
      pref[i] += pref[i-1];

    minn = min(minn, P(pref[i], i));
  }

  int prvi = (minn.Y + 1) % n;
  printf("%d\n", rijesi(prvi));

  return 0;
}

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

kralj.cpp: In function 'int main()':
kralj.cpp:44:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^
kralj.cpp:49:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &poc[i]);
                         ^
kralj.cpp:54:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &on[i]);
                        ^
kralj.cpp:57:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &moji[i]);
                          ^

• Subtask 1: 140 / 140