제출 #224583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
224583		Nightlight	Pilot (NOI19_pilot)	C++14	100 / 100	770 ms	55196 KiB

pilot

#include <bits/stdc++.h>
#define pii pair<int, int>
#define val first
#define id second
using namespace std;

int N, K;
long long sz[1000005];
int par[1000005];
pii H[1000005], Q[1000005];
bitset<1000005> done;
long long ans[1000005], res;

int findpar(int u) {
  if(par[u] == u) return u;
  else {
  	par[u] = findpar(par[u]);
  	return par[u];
  }
}

void merge(int u, int v) {
  u = findpar(u);
  v = findpar(v);
  res -= (sz[u] * (sz[u] + 1)) / 2;
  res -= (sz[v] * (sz[v] + 1)) / 2;
  par[v] = u;
  sz[u] += sz[v];
  res += ((sz[u]  + 1) * sz[u]) / 2;
}

int main() {
//  freopen("inp", "r", stdin);
  scanf("%d %d", &N, &K);
  for(int i = 1; i <= N; i++) {
    scanf("%d", &H[i].val);
    H[i].id = i;
    par[i] = i;
    sz[i] = 1;
  }
  for(int i = 1; i <= K; i++) {
    scanf("%d", &Q[i].val);
    Q[i].id = i;
  }
  sort(H + 1, H + N + 1);
  sort(Q + 1, Q + K + 1);
  int p = 1;
  H[N + 1].val = 1e9;
  Q[K + 1].val = 1e9;
  while(Q[p].val < H[1].val) {
    ans[Q[p].id] = res;
    p++;
  }
  for(int i = 1; i <= N; i++) {
    int now = H[i].id;
    res += sz[now];
    if(done[findpar(now - 1)]) {
      merge(now - 1, now);
    }
    if(done[findpar(now + 1)]) {
      merge(now, now + 1);
    }
    done[now] = 1;
    while(Q[p].val < H[i + 1].val) {
      ans[Q[p].id] = res;
      p++;
    }
  }
  for(int i = 1; i <= K; i++) {
    printf("%lld\n", ans[i]);
  }
}

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

pilot.cpp: In function 'int main()':
pilot.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &N, &K);
   ~~~~~^~~~~~~~~~~~~~~~~
pilot.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &H[i].val);
     ~~~~~^~~~~~~~~~~~~~~~~
pilot.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &Q[i].val);
     ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11