oj.uz

Submission #357663

# Submission time Handle Problem Language Result Execution time Memory
357663 2021-01-24T11:33:40 Z doowey Comparing Plants (IOI20_plants) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
#include "plants.h"

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define fi first
#define se scond
#define mp make_pair

const int N = (int)2e5 + 100;
int A[N];
int vl[N];

void init(int k, vector<int> r) {
    int n = r.size();
    for(int i = 0 ; i < n; i ++ ){
        if(r[i] == 0){
            for(int j = 1; j < k ; j ++ ){
                vl[(i + j) % n] ++ ;
            }
        }
    }
    int pv;
    for(int id = n - 1; id >= 0; id -- ){
        for(int q = 0; q < n; q ++ ){
            if(vl[q] == 0 && r[q] == 0){
                A[q] = id;
                for(int j = 0; j < k ; j ++ ){
                    pv = (q - j + n) % n;
                    r[pv] -- ;
                    if(r[pv] == 0){
                        for(int z = 1; z < k ; z ++ ){
                            vl[(pv + z) % k] ++ ;
                        }
                    }
                    vl[(q + j) % n] -- ;
                }
                break;
            }
        }
    }
}

int compare_plants(int x, int y) {
    if(A[x] < A[y]) return -1;
    return +1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Incorrect 0 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Incorrect 0 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 0 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -