oj.uz

Submission #576193

# Submission time Handle Problem Language Result Execution time Memory
576193 2022-06-12T13:25:26 Z SlavicG Comparing Plants (IOI20_plants) C++17
0 / 100
 69 ms 28468 KB 
#include "bits/stdc++.h"
#include "plants.h"

#define ll long long
#define sz(a) (int)a.size()
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define forn(i, n) for(int i=0;i < n; ++i)
using namespace std;

const int N = 5000;
int ans[N][N];
void init(int k, std::vector<int> r) {
    int n = sz(r);
    vector<bool> vis(n, false);
    while(true) {
        bool br = true;
        forn(i, n) if(!vis[i] && r[i] == 0) br = false;
        if(br) break;

        for(int i = 0; i < n; ++i) {
            if(!vis[i] && r[i] == 0) {
                for(int j = 0; j < n; ++j) {
                    if(r[j]) {
                        ans[i][j] = 1;
                        ans[j][i] = -1;
                    }
                }
            }
        }
        for(int i = 0; i < n; ++i) {
            if(!vis[i] && r[i] == 0) {
                int cur = i;
                vis[i] = true;
                for(int f = 0; f < k; ++f) {
                    cur = (cur - 1 + n) % n;
                    if(!vis[cur])r[cur] = max(0, r[cur] - 1);
                }
            }
        }
    }
}

int compare_plants(int x, int y) {
	return ans[x][y];
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 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 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 69 ms 28468 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

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