oj.uz

답안 #1047395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047395 2024-08-07T12:27:25 Z Tob 자동 인형 (IOI18_doll) C++14
12 / 100
 39 ms 18764 KB 
#include <bits/stdc++.h>

#include "doll.h"

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;
/*
namespace {

constexpr int P_MAX = 20000000;
constexpr int S_MAX = 400000;

int M, N;
std::vector<int> A;

bool answered;
int S;
std::vector<int> IC, IX, IY;

int read_int() {
  int x;
  if (scanf("%d", &x) != 1) {
    fprintf(stderr, "Error while reading input\n");
    exit(1);
  }
  return x;
}

void wrong_answer(const char *MSG) {
  printf("Wrong Answer: %s\n", MSG);
  exit(0);
}

void simulate() {
  if (S > S_MAX) {
    char str[50];
    sprintf(str, "over %d switches", S_MAX);
    wrong_answer(str);
  }
  for (int i = 0; i <= M; ++i) {
    if (!(-S <= IC[i] && IC[i] <= M)) {
      wrong_answer("wrong serial number1");
    }
  }
  for (int j = 1; j <= S; ++j) {
    if (!(-S <= IX[j - 1] && IX[j - 1] <= M)) {
    	cout << IX[j-1] << "\n";
      wrong_answer("wrong serial number2");
    }
    if (!(-S <= IY[j - 1] && IY[j - 1] <= M)) {
      wrong_answer("wrong serial number3");
    }
  }

  int P = 0;
  std::vector<bool> state(S + 1, false);
  int pos = IC[0];
  int k = 0;
  FILE *file_log = fopen("log.txt", "w");
  fprintf(file_log, "0\n");
  for (;;) {
    fprintf(file_log, "%d\n", pos);
    if (pos < 0) {
      if (++P > P_MAX) {
        fclose(file_log);
        char str[50];
        sprintf(str, "over %d inversions", P_MAX);
        wrong_answer(str);
      }
      state[-pos] = !state[-pos];
      pos = state[-pos] ? IX[-(1 + pos)] : IY[-(1 + pos)];
    } else {
      if (pos == 0) {
        break;
      }
      if (k >= N) {
        fclose(file_log);
        wrong_answer("wrong motion");
      }
      if (pos != A[k++]) {
        fclose(file_log);
        wrong_answer("wrong motion");
      }
      pos = IC[pos];
    }
  }
  fclose(file_log);
  if (k != N) {
    wrong_answer("wrong motion");
  }
  for (int j = 1; j <= S; ++j) {
    if (state[j]) {
      wrong_answer("state 'Y'");
    }
  }
  printf("1\n");
//  printf("Accepted: %d %d\n", S, P);
}

}  // namespace

void answer(std::vector<int> C, std::vector<int> X, std::vector<int> Y) {
  if (answered) {
    wrong_answer("answered not exactly once");
  }
  answered = true;
  // check if input format is correct
  if ((int)C.size() != M + 1) {
    wrong_answer("wrong array length");
  }
  if (X.size() != Y.size()) {
    wrong_answer("wrong array length");
  }
  S = X.size();
  IC = C;
  IX = X;
  IY = Y;
}*/


const int maxM = 1e5 + 40, maxN = 2e5 + 7, maxN2 = (1 << 18);

int n, cnt, ofs;
int a[maxN], sw[maxN2];
vector <int> adj[maxN2];

int prec(int x, int y, int lo, int hi) {
	if (hi < ofs-n) return 0;
	if (lo == hi) {
		a[lo] = y;
		return 1;
	}
	int mid = (lo + hi) / 2;
	if (x > ofs) exit(1);
	sw[x] ^= 1;
	if (sw[x]) return prec(2*x, y, lo, mid);
	return prec(2*x+1, y, mid+1, hi);
}

int maxi = 0;

int rek(int lo, int hi) {
	if (hi < ofs-n) return -1;
	if (lo == hi) return a[lo];
	int x = ++cnt;
	int mid = (lo + hi) / 2;
	adj[x].pb(rek(lo, mid));
	adj[x].pb(rek(mid+1, hi));
	return -x;
}

void create_circuit(int m, vector <int> b) {
	n = b.size();
	ofs = 1;
	while (ofs < n) ofs *= 2;
	b.pb(0);
	for (int i = 1; i <= n; ) i += prec(1, b[i], 0, ofs-1);
	rek(0, ofs-1);
	vector <int> res1(m+1), res2(cnt), res3(cnt);
	res1[0] = b[0];
	for (int i = 1; i <= m; i++) res1[i] = -min(cnt,1);
	for (int i = 1; i <= cnt; i++) res2[i-1] = adj[i][0], res3[i-1] = adj[i][1];
	answer(res1, res2, res3);
}


/*
int main() {
  M = read_int();
  N = read_int();
  A.resize(N);
  for (int k = 0; k < N; ++k) {
  	A[k] = read_int();
  }

  answered = false;
  create_circuit(M, A);
  if (!answered) {
    wrong_answer("answered not exactly once");
  }
  FILE *file_out = fopen("out.txt", "w");
  fprintf(file_out, "%d\n", S);
  for (int i = 0; i <= M; ++i) {
    fprintf(file_out, "%d\n", IC[i]);
  }
  for (int j = 1; j <= S; ++j) {
    fprintf(file_out, "%d %d\n", IX[j - 1], IY[j - 1]);
  }
  fclose(file_out);
  simulate();
  return 0;
}*/

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 23 ms 12356 KB Output is correct
3 Correct 23 ms 12884 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 5 ms 7772 KB Output is correct
6 Correct 31 ms 15948 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 23 ms 12356 KB Output is correct
3 Correct 23 ms 12884 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 5 ms 7772 KB Output is correct
6 Correct 31 ms 15948 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 39 ms 18764 KB Output is correct
9 Runtime error 13 ms 16472 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 23 ms 12356 KB Output is correct
3 Correct 23 ms 12884 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 5 ms 7772 KB Output is correct
6 Correct 31 ms 15948 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 39 ms 18764 KB Output is correct
9 Runtime error 13 ms 16472 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 1 ms 6760 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 2 ms 6744 KB Output is correct

Subtask #5
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 35 ms 16516 KB Output is correct
3 Runtime error 12 ms 15448 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 35 ms 16516 KB Output is correct
3 Runtime error 12 ms 15448 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -