oj.uz

Submission #131286

# Submission time Handle Problem Language Result Execution time Memory
131286 2019-07-17T00:16:48 Z DanerZein Paint By Numbers (IOI16_paint) C++14
32 / 100
 2 ms 504 KB 
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;

std::string solve_puzzle(std::string s, std::vector<int> c) {
    string rp="";
    vector<int>id;
    for(int i=0;i<c.size();i++){
        for(int j=0;j<c[i];j++){
            rp+='X';
        }
        id.push_back(rp.size());
        if(rp.size()==s.size()){
        break;
        }
        rp+='_';
    }
    int t;

    if(rp[rp.size()-1]=='_'){
        t=1;
        t+=(s.size()-rp.size());
        for(int i=1;i<t;i++){
            rp+='_';
        }
    }
    else{
        return rp;
    }
    // cout<<"t: "<<t<<endl;
    /*for(int i=0;i<id.size();i++){
      cout<<id[i]<<" ";
    }
    cout<<endl;*/
    string ans;
    ans.resize(rp.size());
    //int id=0;
    //cout<<rp<<" "<<t<<endl;
    int j=0;
    for(int i=0;i<rp.size();i++){
        if(rp[i]=='X'){
	  if(id[j]-1>=i+t){
            if(rp[i+t]=='X'){
                ans[i+t]='X';
                //ans[i]='?';
            }
	  }
	  if(i==id[j]-1){
	    j++;
	  }
        }
    }
    for(int i=0;i<ans.size();i++){
        if(ans[i]!='X'){
        ans[i]='?';
        }
        if(s[i]=='_'){
        ans[i]='_';
        }
    }
    //    cout<<ans[7]<<endl;
    return ans;
}
/*
const int S_MAX_LEN = 200 * 1000;
char buf[S_MAX_LEN + 1];

int main() {
    assert(1 == scanf("%s", buf));
    std::string s = buf;
    int c_len;
    assert(1 == scanf("%d", &c_len));
    std::vector<int> c(c_len);
    for (int i = 0; i < c_len; i++) {
        assert(1 == scanf("%d", &c[i]));
    }
    std::string ans = solve_puzzle(s, c);


    printf("%s\n", ans.data());
    return 0;
}*/

Compilation message

paint.cpp: In function 'std::__cxx11::string solve_puzzle(std::__cxx11::string, std::vector<int>)':
paint.cpp:8:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<c.size();i++){
                 ~^~~~~~~~~
paint.cpp:40:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<rp.size();i++){
                 ~^~~~~~~~~~
paint.cpp:53:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ans.size();i++){
                 ~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
3.0 / 3.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
0 / 27.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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