제출 #1311573

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311573		robijoy	Pyramids (IOI24_pyramids)	C++20	0 / 100	33 ms	5064 KiB

pyramids

#include <bits/stdc++.h>
using namespace std;

#define ll long long
vector<ll> robi1, robi2;

void init(std::vector<int> A, std::vector<int> B) {
    robi1.resize(A.size());
    robi2.resize(B.size());
    robi1[0] = A[0];
    for (int i = 1; i < A.size(); ++i) robi1[i] += robi1[i-1]+A[i];
    robi2[0] = B[0];
    for (int i = 1; i < B.size(); ++i) robi2[i] += robi2[i-1]+B[i];
}

bool can_transform(int L, int R, int X, int Y) {
  ll sum1 = 0, sum2 = 0;
  L--;
  int x = 0;
  if(L!=-1) x = robi1[x];

  X--;
  int y = 0;
  if(X!=-1) y = robi2[y];

  sum1 = robi1[R]-x;
  sum2 = robi2[R]-y;
  return (sum1==sum2);
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 20
• Subtask 4: 0 / 30