oj.uz

Submission #312450

# Submission time Handle Problem Language Result Execution time Memory
312450 2020-10-13T10:08:09 Z talant117408 Paint By Numbers (IOI16_paint) C++17
32 / 100
 1 ms 384 KB 
#include "paint.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <ll, ll> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) (int)(v).size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

string solve_puzzle(string s, vector<int> c) {
    string res = "";
    string a = "", b = "";
    int pos = 0, i, clues = sz(c), j, n = sz(s);
    vector <pii> borders(clues);
    
    for(i = 0; i < n; i++){
        a += '.';
        b += '.';
        res += '?';
    }
    
    for(i = 0; i < clues; i++){
        int flag = -1;
        while(pos < n && s[pos] == '_') pos++;
        for(j = pos; j < pos+c[i]; j++){
            if(s[j] == '_') flag = j;
        }
        if(flag == -1){
            for(j = pos; j < pos+c[i]; j++){
                a[j] = 'X';
            }
            borders[i].first = pos;
            pos += c[i]+1;
        }
        else{
            i--;
            pos = flag+1;
        }
    }
    
    pos = n-1;
    for(i = clues-1; i >= 0; i--){
        int flag = -1;
        while(pos >= 0 && s[pos] == '_') pos--;
        for(j = pos; j > pos-c[i]; j--){
            if(s[j] == '_') flag = j;
        }
        if(flag == -1){
            for(j = pos; j > pos-c[i]; j--){
                b[j] = 'X';
            }
            borders[i].second = pos-c[i]+1;
            pos -= (c[i]+1);
        }
        else{
            i++;
            pos = flag-1;
        }
    }
    
    for(i = 0; i < n; i++){
        if(s[i] == '_'){
            res[i] = '_';
        }
    }
    
    for(i = 0; i < clues; i++){
        int l = borders[i].first, r = borders[i].second;
        for(j = r; j < l+c[i]; j++){
            res[j] = 'X';
        }
        borders[i].first = r;
        borders[i].second = l+c[i];
    }
    
    for(i = 0; i < clues-1; i++){
        int l1 = borders[i].first, r1 = borders[i].second;
        int l2 = borders[i+1].first, r2 = borders[i+1].second;
        
        if(l1 < r1 && l2 < r2 && abs(r1-l2) < 2){
            res[r1] = '_';
        }
    }
    
    return res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 13, m = 1
2 Correct 0 ms 256 KB n = 18, m = 1
3 Correct 1 ms 256 KB n = 17, m = 1
4 Correct 1 ms 384 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 0 ms 256 KB n = 20, m = 1
7 Correct 0 ms 256 KB n = 20, m = 1

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 13, m = 1
2 Correct 0 ms 256 KB n = 18, m = 1
3 Correct 1 ms 256 KB n = 17, m = 1
4 Correct 1 ms 384 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 0 ms 256 KB n = 20, m = 1
7 Correct 0 ms 256 KB n = 20, m = 1
8 Correct 0 ms 256 KB n = 20, m = 5
9 Correct 0 ms 256 KB n = 18, m = 3
10 Correct 1 ms 256 KB n = 17, m = 2
11 Correct 1 ms 256 KB n = 20, m = 2
12 Correct 1 ms 384 KB n = 17, m = 4
13 Correct 0 ms 256 KB n = 17, m = 6
14 Correct 1 ms 256 KB n = 17, m = 1
15 Correct 1 ms 256 KB n = 17, m = 4
16 Correct 1 ms 384 KB n = 13, m = 3
17 Correct 1 ms 256 KB n = 18, m = 4
18 Correct 1 ms 256 KB n = 20, m = 10
19 Correct 1 ms 256 KB n = 19, m = 10

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 13, m = 1
2 Correct 0 ms 256 KB n = 18, m = 1
3 Correct 1 ms 256 KB n = 17, m = 1
4 Correct 1 ms 384 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 0 ms 256 KB n = 20, m = 1
7 Correct 0 ms 256 KB n = 20, m = 1
8 Correct 0 ms 256 KB n = 20, m = 5
9 Correct 0 ms 256 KB n = 18, m = 3
10 Correct 1 ms 256 KB n = 17, m = 2
11 Correct 1 ms 256 KB n = 20, m = 2
12 Correct 1 ms 384 KB n = 17, m = 4
13 Correct 0 ms 256 KB n = 17, m = 6
14 Correct 1 ms 256 KB n = 17, m = 1
15 Correct 1 ms 256 KB n = 17, m = 4
16 Correct 1 ms 384 KB n = 13, m = 3
17 Correct 1 ms 256 KB n = 18, m = 4
18 Correct 1 ms 256 KB n = 20, m = 10
19 Correct 1 ms 256 KB n = 19, m = 10
20 Correct 1 ms 256 KB n = 100, m = 5
21 Correct 1 ms 256 KB n = 90, m = 3
22 Correct 1 ms 256 KB n = 86, m = 2
23 Correct 1 ms 256 KB n = 81, m = 4
24 Correct 1 ms 256 KB n = 89, m = 10
25 Correct 1 ms 256 KB n = 81, m = 23
26 Correct 1 ms 384 KB n = 86, m = 8
27 Correct 1 ms 256 KB n = 53, m = 22
28 Correct 1 ms 256 KB n = 89, m = 35
29 Correct 0 ms 256 KB n = 63, m = 25
30 Correct 1 ms 256 KB n = 100, m = 50
31 Correct 1 ms 384 KB n = 99, m = 50

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 13, m = 1
2 Correct 0 ms 256 KB n = 18, m = 1
3 Correct 1 ms 256 KB n = 17, m = 1
4 Correct 1 ms 384 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 0 ms 256 KB n = 20, m = 1
7 Correct 0 ms 256 KB n = 20, m = 1
8 Correct 0 ms 256 KB n = 20, m = 5
9 Correct 0 ms 256 KB n = 18, m = 3
10 Correct 1 ms 256 KB n = 17, m = 2
11 Correct 1 ms 256 KB n = 20, m = 2
12 Correct 1 ms 384 KB n = 17, m = 4
13 Correct 0 ms 256 KB n = 17, m = 6
14 Correct 1 ms 256 KB n = 17, m = 1
15 Correct 1 ms 256 KB n = 17, m = 4
16 Correct 1 ms 384 KB n = 13, m = 3
17 Correct 1 ms 256 KB n = 18, m = 4
18 Correct 1 ms 256 KB n = 20, m = 10
19 Correct 1 ms 256 KB n = 19, m = 10
20 Correct 1 ms 256 KB n = 100, m = 5
21 Correct 1 ms 256 KB n = 90, m = 3
22 Correct 1 ms 256 KB n = 86, m = 2
23 Correct 1 ms 256 KB n = 81, m = 4
24 Correct 1 ms 256 KB n = 89, m = 10
25 Correct 1 ms 256 KB n = 81, m = 23
26 Correct 1 ms 384 KB n = 86, m = 8
27 Correct 1 ms 256 KB n = 53, m = 22
28 Correct 1 ms 256 KB n = 89, m = 35
29 Correct 0 ms 256 KB n = 63, m = 25
30 Correct 1 ms 256 KB n = 100, m = 50
31 Correct 1 ms 384 KB n = 99, m = 50
32 Correct 0 ms 256 KB n = 13, m = 4
33 Correct 1 ms 256 KB n = 86, m = 2
34 Incorrect 1 ms 256 KB char #38 differ - expected: '_', found: '?'
35 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 13, m = 1
2 Correct 0 ms 256 KB n = 18, m = 1
3 Correct 1 ms 256 KB n = 17, m = 1
4 Correct 1 ms 384 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 0 ms 256 KB n = 20, m = 1
7 Correct 0 ms 256 KB n = 20, m = 1
8 Correct 0 ms 256 KB n = 20, m = 5
9 Correct 0 ms 256 KB n = 18, m = 3
10 Correct 1 ms 256 KB n = 17, m = 2
11 Correct 1 ms 256 KB n = 20, m = 2
12 Correct 1 ms 384 KB n = 17, m = 4
13 Correct 0 ms 256 KB n = 17, m = 6
14 Correct 1 ms 256 KB n = 17, m = 1
15 Correct 1 ms 256 KB n = 17, m = 4
16 Correct 1 ms 384 KB n = 13, m = 3
17 Correct 1 ms 256 KB n = 18, m = 4
18 Correct 1 ms 256 KB n = 20, m = 10
19 Correct 1 ms 256 KB n = 19, m = 10
20 Correct 1 ms 256 KB n = 100, m = 5
21 Correct 1 ms 256 KB n = 90, m = 3
22 Correct 1 ms 256 KB n = 86, m = 2
23 Correct 1 ms 256 KB n = 81, m = 4
24 Correct 1 ms 256 KB n = 89, m = 10
25 Correct 1 ms 256 KB n = 81, m = 23
26 Correct 1 ms 384 KB n = 86, m = 8
27 Correct 1 ms 256 KB n = 53, m = 22
28 Correct 1 ms 256 KB n = 89, m = 35
29 Correct 0 ms 256 KB n = 63, m = 25
30 Correct 1 ms 256 KB n = 100, m = 50
31 Correct 1 ms 384 KB n = 99, m = 50
32 Correct 0 ms 256 KB n = 13, m = 4
33 Correct 1 ms 256 KB n = 86, m = 2
34 Incorrect 1 ms 256 KB char #38 differ - expected: '_', found: '?'
35 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 13, m = 1
2 Correct 0 ms 256 KB n = 18, m = 1
3 Correct 1 ms 256 KB n = 17, m = 1
4 Correct 1 ms 384 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 0 ms 256 KB n = 20, m = 1
7 Correct 0 ms 256 KB n = 20, m = 1
8 Correct 0 ms 256 KB n = 20, m = 5
9 Correct 0 ms 256 KB n = 18, m = 3
10 Correct 1 ms 256 KB n = 17, m = 2
11 Correct 1 ms 256 KB n = 20, m = 2
12 Correct 1 ms 384 KB n = 17, m = 4
13 Correct 0 ms 256 KB n = 17, m = 6
14 Correct 1 ms 256 KB n = 17, m = 1
15 Correct 1 ms 256 KB n = 17, m = 4
16 Correct 1 ms 384 KB n = 13, m = 3
17 Correct 1 ms 256 KB n = 18, m = 4
18 Correct 1 ms 256 KB n = 20, m = 10
19 Correct 1 ms 256 KB n = 19, m = 10
20 Correct 1 ms 256 KB n = 100, m = 5
21 Correct 1 ms 256 KB n = 90, m = 3
22 Correct 1 ms 256 KB n = 86, m = 2
23 Correct 1 ms 256 KB n = 81, m = 4
24 Correct 1 ms 256 KB n = 89, m = 10
25 Correct 1 ms 256 KB n = 81, m = 23
26 Correct 1 ms 384 KB n = 86, m = 8
27 Correct 1 ms 256 KB n = 53, m = 22
28 Correct 1 ms 256 KB n = 89, m = 35
29 Correct 0 ms 256 KB n = 63, m = 25
30 Correct 1 ms 256 KB n = 100, m = 50
31 Correct 1 ms 384 KB n = 99, m = 50
32 Correct 0 ms 256 KB n = 13, m = 4
33 Correct 1 ms 256 KB n = 86, m = 2
34 Incorrect 1 ms 256 KB char #38 differ - expected: '_', found: '?'
35 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 13, m = 1
2 Correct 0 ms 256 KB n = 18, m = 1
3 Correct 1 ms 256 KB n = 17, m = 1
4 Correct 1 ms 384 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 0 ms 256 KB n = 20, m = 1
7 Correct 0 ms 256 KB n = 20, m = 1
8 Correct 0 ms 256 KB n = 20, m = 5
9 Correct 0 ms 256 KB n = 18, m = 3
10 Correct 1 ms 256 KB n = 17, m = 2
11 Correct 1 ms 256 KB n = 20, m = 2
12 Correct 1 ms 384 KB n = 17, m = 4
13 Correct 0 ms 256 KB n = 17, m = 6
14 Correct 1 ms 256 KB n = 17, m = 1
15 Correct 1 ms 256 KB n = 17, m = 4
16 Correct 1 ms 384 KB n = 13, m = 3
17 Correct 1 ms 256 KB n = 18, m = 4
18 Correct 1 ms 256 KB n = 20, m = 10
19 Correct 1 ms 256 KB n = 19, m = 10
20 Correct 1 ms 256 KB n = 100, m = 5
21 Correct 1 ms 256 KB n = 90, m = 3
22 Correct 1 ms 256 KB n = 86, m = 2
23 Correct 1 ms 256 KB n = 81, m = 4
24 Correct 1 ms 256 KB n = 89, m = 10
25 Correct 1 ms 256 KB n = 81, m = 23
26 Correct 1 ms 384 KB n = 86, m = 8
27 Correct 1 ms 256 KB n = 53, m = 22
28 Correct 1 ms 256 KB n = 89, m = 35
29 Correct 0 ms 256 KB n = 63, m = 25
30 Correct 1 ms 256 KB n = 100, m = 50
31 Correct 1 ms 384 KB n = 99, m = 50
32 Correct 0 ms 256 KB n = 13, m = 4
33 Correct 1 ms 256 KB n = 86, m = 2
34 Incorrect 1 ms 256 KB char #38 differ - expected: '_', found: '?'
35 Halted 0 ms 0 KB -