This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define MAX_N 10000
int dir[MAX_N];
int DeletePlan( int N, int M, int K, int *A, int *B)
{
for(int i = 0;i < N;i++)
dir[A[i]]++;
dir[0] += dir[1];
if(dir[0] == K) return 1;
else if(dir[1] <= K) return 1 + K - dir[1];
else return K;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |