Submission #1238574

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238574		matisito	모자이크 (IOI24_mosaic)	C++20	0 / 100	1202 ms	1874056 KiB

mosaic

#include "mosaic.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <cassert>

using namespace std;
#define dbg(x) cerr<<#x<<": "<<x<<"\n";

/*  
ValeNotta lover
*/

vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
  int n=(int)X.size();
  vector<vector<long long>>dp(n+1, vector<long long>(n+1));
  for(int i=1 ; i<=n ; i++){
    for(int j=1 ; j<=n ; j++){
      if(i==1) dp[i][j]=Y[j];
      else if(j==1) dp[i][j]=X[i];
      else{
        if(dp[i-1][j]==0 && dp[i][j-1]==0) dp[i][j]=1;
      }
    }
  }
  for(int i=1 ; i<=n ; i++){
    for(int j=1 ; j<=n ; j++){
      dp[i][j]+=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
    }
  }
  n=(int)T.size();
  vector<long long>ans(n);
  for(int i=0 ; i<n ; i++){
    T[i]++; B[i]++; L[i]++; R[i]++;
    ans[i]=dp[B[i]][R[i]]-dp[T[i]-1][R[i]]-dp[B[i]][L[i]-1]+dp[T[i]-1][L[i]-1];
  }
  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22