| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 758 | CodingIsHard | 파일 삭제 (GA3_delete) | C++98 | 0 ms | 952 KiB |
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... | ||||
