oj.uz

Submission #1073486

# Submission time Handle Problem Language Result Execution time Memory
1073486 2024-08-24T15:18:31 Z blushingecchigirl Comparing Plants (IOI20_plants) C++17
0 / 100
 62 ms 3152 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

vector<pair<pair<int, int>, int>> p;

void init(int k, std::vector<int> r) {
    int n = r.size(), x;
    p.resize(n);
    for(int i = 0; i<n; i++) {
        if(r[i]!=r[(i+1)%n]) {
            x = i;
            break;
        }
    }
    int cur = 0, g = 0;

    for(int i = x; i<n+x; i++) {
        p[i%n].second = cur;
        if(r[i%n]) cur--;
        else cur++;
        p[i%n].first.first = p[(i+1)%n].first.second = g;
        if(r[i%n] != r[(i+1)%n]) g++;
    }
    return;
}
int compare_plants(int x, int y) {
    auto a = p[x].first, b = p[y].first;
    if(a.first == b.second || a.second == b.first || a.second == b.first || a.second == b.second) {
        if(p[x].second>p[y].second) return -1;
        return 1;
    }
    return 0;
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:19:23: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   19 |     for(int i = x; i<n+x; i++) {
      |                      ~^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 62 ms 3152 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 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 344 KB Output is correct
2 Incorrect 0 ms 348 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 1 ms 348 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 1 ms 348 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 596 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 62 ms 3152 KB Output isn't correct
7 Halted 0 ms 0 KB -