oj.uz

답안 #899393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899393 2024-01-06T02:07:47 Z cig32 Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 0 ms 348 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7; 
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
static void run_with_stack_size(void (*func)(void), size_t stsize) {
  char *stack, *send;
  stack = (char *)malloc(stsize);
  send = stack + stsize - 16;
  send = (char *)((uintptr_t)send / 16 * 16);
  asm volatile(
    "mov %%rsp, (%0)\n"
    "mov %0, %%rsp\n"
    :
    : "r"(send));
  func();
  asm volatile("mov (%0), %%rsp\n" : : "r"(send));
  free(stack);
}
void solve(int tc) {
  int n;
  cin >> n;
  int ans = 0;
  int x[2*n+1], y[2*n+1];
  for(int i=1; i<=2*n; i++) {
    cin >> x[i] >> y[i];
    if(x[i] < 1) {
      ans += abs(x[i]) + 1;
      x[i] = 1;
    }
    if(x[i] > n) {
      ans += x[i] - n;
      x[i] = n;
    }
    if(y[i] < 1) {
      ans += abs(y[i]) + 1;
      y[i] = 1;
    }
    if(y[i] > 2) {
      ans += y[i] - 2;
      y[i] = 2;
    }
  }
  int coins[n+1][3];
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=2; j++) coins[i][j] = 0;
  }
  for(int i=1; i<=2*n; i++) {
    coins[x[i]][y[i]]++;
  }
  stack<int> stk[3];
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=2; j++) {
      if(coins[i][j] > 1) {
        for(int k=1; k<=coins[i][j]-1; k++) stk[j].push(i);
        coins[i][j] = 1;
      }
    }
    for(int j=1; j<=2; j++) {
      if(coins[i][j] == 0) {
        if(stk[j].size()) {
          ans += i - stk[j].top();
          stk[j].pop();
          coins[i][j] = 1;
        }
        else if(stk[3-j].size()) {
          ans += i - stk[3-j].top() + 1;
          stk[3-j].pop();
          coins[i][j] = 1;
        }
      }
    }
  }
  for(int i=n; i>=1; i--) {
    for(int j=1; j<=2; j++) {
      if(coins[i][j] > 1) {
        for(int k=1; k<=coins[i][j]-1; k++) stk[j].push(i);
        coins[i][j] = 1;
      }
    }
    for(int j=1; j<=2; j++) {
      if(coins[i][j] == 0) {
        if(stk[j].size()) {
          ans += stk[j].top() - i;
          stk[j].pop();
          coins[i][j] = 1;
        }
        else if(stk[3-j].size()) {
          ans += stk[3-j].top() - i + 1;
          stk[3-j].pop();
          coins[i][j] = 1;
        }
      }
    }
  }
  cout << ans << "\n";
}
void uwu() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
int32_t main() {
  #ifdef ONLINE_JUDGE
  uwu();
  #endif
  #ifndef ONLINE_JUDGE
  run_with_stack_size(uwu, 1024 * 1024 * 1024); // run with a 1 GiB stack
  #endif
}
/*
g++ B.cpp -std=c++17 -O2 -o B
./B < input.txt
*/

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -