Submission #248556

#TimeUsernameProblemLanguageResultExecution timeMemory
248556lakshith_Wall (IOI14_wall)C++14
8 / 100
3077 ms18296 KiB
#include <bits/stdc++.h>
#include "wall.h"

using namespace std;

//subtask 1
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
  for(int i=0;i<n;i++)finalHeight[i]=0;
  for(int i=0;i<k;i++){
    int l=left[i],r=right[i],h=height[i],o=op[i];
    for(int j=l;j<=r;j++)
      if(o==1)finalHeight[j] = max(h,finalHeight[j]);
      else finalHeight[j] = min(h,finalHeight[j]);
  }
  return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...