Submission #254161

#TimeUsernameProblemLanguageResultExecution timeMemory
254161PedroBigMan벽 (IOI14_wall)C++14
8 / 100
3099 ms9080 KiB
#include "wall.h" #include <iostream> #include <vector> #include <cmath> #include <algorithm> #include <string> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <queue> #include <deque> #include <list> #include <iomanip> #include <stdlib.h> #include <time.h> #include <cstring> using namespace std; typedef long long int ll; typedef unsigned long long int ull; typedef long double ld; #define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++) #define pb push_back #define mp make_pair #define pl pair<ll,ll> #define ff first #define ss second #define whole(x) x.begin(),x.end() #define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl #define INF 500000000LL #define EPS 0.00000001 #define pi 3.14159 void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) { REP(i,0,n) {finalHeight[i]=0;} REP(i,0,k) { REP(j,left[i],right[i]+1) { if(op[i]==1) {finalHeight[j]=max(finalHeight[j],height[i]);} else {finalHeight[j]=min(finalHeight[j],height[i]);} } } 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...