제출 #1170648

#제출 시각아이디문제언어결과실행 시간메모리
1170648AbdullahIshfaq모자이크 (IOI24_mosaic)C++20
8 / 100
73 ms11964 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
ll sum(ll x,ll y){
  if(x < 0 or y < 0){
    return 0;
  }
  return ((x * y) + 1) / 2;
}
std::vector<long long> mosaic(
	std::vector<int> X, std::vector<int> Y,
    std::vector<int> T, std::vector<int> B,
    std::vector<int> L, std::vector<int> R){
      vector<ll> ans;
      for(int i = 0; i < T.size(); i ++){
        ll x1 = T[i], y1 = L[i], x2 = B[i], y2 = R[i];
        ans.push_back(sum(x2,y2) - sum(x2, y1 - 1) - sum(x1 - 1, y2) + sum(x1 - 1, y1 - 1));
      }
      return ans;
    }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...