oj.uz

Submission #561621

# Submission time Handle Problem Language Result Execution time Memory
561621 2022-05-13T08:57:21 Z PiejanVDC Painting Squares (IOI20_squares) C++17
0 / 100
 103 ms 500 KB 
#include <bits/stdc++.h>
#include "squares.h"
using namespace std;

vector<int>paint(int n) {
    if(n == 2)
        return {1,0,1};
    int sz = 0, c = 0;
    vector<int>v(n+1);
    for(int i = 0 ; i < n ; i++) {
        if(c)
            v[i] = 0, c--;
        else
            v[i] = 1, c = ++sz;
    }

    int f = -1, s = -1;
    for(int i = n-1 ; i >= 0 ; i--) {
        if(v[i] == 1) {
            if(f == -1)
                f = i;
            else if(s == -1)
                s = i;
        }
    }

    v[n] = 2*(f - s -1)+3;

    return v;
}

int find_location(int n, vector<int>v) {
    if(n == 2)
        return (v[0] == 1 ? 1 : 2);
    for(int i = 0 ; i < n ; i++) {
        if(v[i] == -1) {
            return n - i;
        }
    }
    int f = -1, s = -1;
    for(int i = 0 ; i < n ; i++) {
        if(v[i] == 1) {
            if(f == -1)
                f = i;
            else if(s == -1)
                s = i;
        }
    }
    assert(f != -1 && s != -1);
    int len = s - f - 1;
    return (len * (len-1))/2 + (len-1) - f;
}

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 64 ms 444 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 103 ms 500 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -