Submission #1208675

#TimeUsernameProblemLanguageResultExecution timeMemory
1208675peraRobots (IOI13_robots)C++20
14 / 100
119 ms6576 KiB
#include<bits/stdc++.h> #include "robots.h" using namespace std; int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) { sort(X , X + A); vector<int> a(T) , c(A); for(int i = 0;i < T;i ++){ a[i] = -1; for(int bit = 21;bit >= 0;bit--){ a[i] += 1 << bit; if(a[i] >= A){ a[i] -= 1 << bit; }else if(X[a[i]] > W[i]){ a[i] -= 1 << bit; } } ++a[i]; if(a[i] == A){ return -1; } c[A - a[i] - 1]++; } int ans = 0; for(int i = 1;i < A;i ++){ c[i] += c[i - 1]; } for(int i = 0;i < A;i ++){ ans = max(ans , (c[i] + i) / (i + 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...