Submission #700870

# Submission time Handle Problem Language Result Execution time Memory
700870 2023-02-19T09:40:14 Z Doncho_Bonboncho Paint By Numbers (IOI16_paint) C++14
32 / 100
1 ms 316 KB
#include "paint.h"
#include <bits/stdc++.h>
#include <cstdlib>

int pref[128];
	
std::string nas = "";

void f( int l, int r, int n ){
	int size = r - l + 1;
//	std::cerr<<" ! "<<size<<" "<<n<<"\n";
	for( int i=0 ; i < size - n ; i++ ) nas[l+i] = nas[r-i] = '?';
}

std::string solve_puzzle(std::string s, std::vector<int> c) {

	for( int i=0 ; i<s.size() ; i++ ) nas += 'X';

	for( int i=0 ; i<c.size() ; i++ ) pref[i] = ( i ? pref[i-1] : 0 ) + c[i];

	if( pref[c.size()-1] + c.size()-1 == s.size() ){
		int ind = 0;
		std::string nas = "";
		for( int i=0 ; i<c.size() ; i++ ){
			for( int j=0 ; j<c[i] ; j++ ) nas += 'X';
			if( i != c.size() -1 ) nas += '_';
		}
		return nas;
	}

	/*
	std::cerr<<"\n";
	for( int i=0 ; i<c.size() ; i++ ) std::cerr<<pref[i]<<"\n";
	std::cerr<<"\n";
	*/

	for( int i=0 ; i <c.size() ; i++ ){
		int l = ( i ? pref[i-1] + i : 0 );
		int r = s.size() - ( pref[c.size()-1]-pref[i] + c.size() - i -1 )-1;
	//	std::cerr<<s.size()<<" - ( "<<pref[c.size()-1]<<" - "<<pref[i]<<" + "<<c.size()<<" - "<<i<<" - "<<1<<")\n";
	//	std::cerr<<l<<" "<<r<<" , "<<c[i]<<"\n";
		f( l, r, c[i] );
	}

    return nas;
}

Compilation message

paint.cpp: In function 'std::string solve_puzzle(std::string, std::vector<int>)':
paint.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for( int i=0 ; i<s.size() ; i++ ) nas += 'X';
      |                 ~^~~~~~~~~
paint.cpp:19:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for( int i=0 ; i<c.size() ; i++ ) pref[i] = ( i ? pref[i-1] : 0 ) + c[i];
      |                 ~^~~~~~~~~
paint.cpp:24:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for( int i=0 ; i<c.size() ; i++ ){
      |                  ~^~~~~~~~~
paint.cpp:26:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |    if( i != c.size() -1 ) nas += '_';
      |        ~~^~~~~~~~~~~~~~
paint.cpp:22:7: warning: unused variable 'ind' [-Wunused-variable]
   22 |   int ind = 0;
      |       ^~~
paint.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for( int i=0 ; i <c.size() ; i++ ){
      |                 ~~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 13, m = 1
2 Correct 0 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 0 ms 212 KB n = 1, m = 1
5 Correct 0 ms 212 KB n = 20, m = 1
6 Correct 0 ms 212 KB n = 20, m = 1
7 Correct 0 ms 212 KB n = 20, m = 1
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 13, m = 1
2 Correct 0 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 0 ms 212 KB n = 1, m = 1
5 Correct 0 ms 212 KB n = 20, m = 1
6 Correct 0 ms 212 KB n = 20, m = 1
7 Correct 0 ms 212 KB n = 20, m = 1
8 Correct 0 ms 212 KB n = 20, m = 5
9 Correct 0 ms 212 KB n = 18, m = 3
10 Correct 1 ms 212 KB n = 17, m = 2
11 Correct 0 ms 212 KB n = 20, m = 2
12 Correct 0 ms 212 KB n = 17, m = 4
13 Correct 1 ms 212 KB n = 17, m = 6
14 Correct 1 ms 212 KB n = 17, m = 1
15 Correct 0 ms 212 KB n = 17, m = 4
16 Correct 1 ms 212 KB n = 13, m = 3
17 Correct 1 ms 212 KB n = 18, m = 4
18 Correct 1 ms 212 KB n = 20, m = 10
19 Correct 0 ms 212 KB n = 19, m = 10
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 13, m = 1
2 Correct 0 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 0 ms 212 KB n = 1, m = 1
5 Correct 0 ms 212 KB n = 20, m = 1
6 Correct 0 ms 212 KB n = 20, m = 1
7 Correct 0 ms 212 KB n = 20, m = 1
8 Correct 0 ms 212 KB n = 20, m = 5
9 Correct 0 ms 212 KB n = 18, m = 3
10 Correct 1 ms 212 KB n = 17, m = 2
11 Correct 0 ms 212 KB n = 20, m = 2
12 Correct 0 ms 212 KB n = 17, m = 4
13 Correct 1 ms 212 KB n = 17, m = 6
14 Correct 1 ms 212 KB n = 17, m = 1
15 Correct 0 ms 212 KB n = 17, m = 4
16 Correct 1 ms 212 KB n = 13, m = 3
17 Correct 1 ms 212 KB n = 18, m = 4
18 Correct 1 ms 212 KB n = 20, m = 10
19 Correct 0 ms 212 KB n = 19, m = 10
20 Correct 1 ms 212 KB n = 100, m = 5
21 Correct 1 ms 212 KB n = 90, m = 3
22 Correct 0 ms 212 KB n = 86, m = 2
23 Correct 0 ms 212 KB n = 81, m = 4
24 Correct 0 ms 212 KB n = 89, m = 10
25 Correct 0 ms 308 KB n = 81, m = 23
26 Correct 1 ms 212 KB n = 86, m = 8
27 Correct 1 ms 212 KB n = 53, m = 22
28 Correct 0 ms 212 KB n = 89, m = 35
29 Correct 1 ms 212 KB n = 63, m = 25
30 Correct 0 ms 212 KB n = 100, m = 50
31 Correct 1 ms 212 KB n = 99, m = 50
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 13, m = 1
2 Correct 0 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 0 ms 212 KB n = 1, m = 1
5 Correct 0 ms 212 KB n = 20, m = 1
6 Correct 0 ms 212 KB n = 20, m = 1
7 Correct 0 ms 212 KB n = 20, m = 1
8 Correct 0 ms 212 KB n = 20, m = 5
9 Correct 0 ms 212 KB n = 18, m = 3
10 Correct 1 ms 212 KB n = 17, m = 2
11 Correct 0 ms 212 KB n = 20, m = 2
12 Correct 0 ms 212 KB n = 17, m = 4
13 Correct 1 ms 212 KB n = 17, m = 6
14 Correct 1 ms 212 KB n = 17, m = 1
15 Correct 0 ms 212 KB n = 17, m = 4
16 Correct 1 ms 212 KB n = 13, m = 3
17 Correct 1 ms 212 KB n = 18, m = 4
18 Correct 1 ms 212 KB n = 20, m = 10
19 Correct 0 ms 212 KB n = 19, m = 10
20 Correct 1 ms 212 KB n = 100, m = 5
21 Correct 1 ms 212 KB n = 90, m = 3
22 Correct 0 ms 212 KB n = 86, m = 2
23 Correct 0 ms 212 KB n = 81, m = 4
24 Correct 0 ms 212 KB n = 89, m = 10
25 Correct 0 ms 308 KB n = 81, m = 23
26 Correct 1 ms 212 KB n = 86, m = 8
27 Correct 1 ms 212 KB n = 53, m = 22
28 Correct 0 ms 212 KB n = 89, m = 35
29 Correct 1 ms 212 KB n = 63, m = 25
30 Correct 0 ms 212 KB n = 100, m = 50
31 Correct 1 ms 212 KB n = 99, m = 50
32 Incorrect 0 ms 316 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 13, m = 1
2 Correct 0 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 0 ms 212 KB n = 1, m = 1
5 Correct 0 ms 212 KB n = 20, m = 1
6 Correct 0 ms 212 KB n = 20, m = 1
7 Correct 0 ms 212 KB n = 20, m = 1
8 Correct 0 ms 212 KB n = 20, m = 5
9 Correct 0 ms 212 KB n = 18, m = 3
10 Correct 1 ms 212 KB n = 17, m = 2
11 Correct 0 ms 212 KB n = 20, m = 2
12 Correct 0 ms 212 KB n = 17, m = 4
13 Correct 1 ms 212 KB n = 17, m = 6
14 Correct 1 ms 212 KB n = 17, m = 1
15 Correct 0 ms 212 KB n = 17, m = 4
16 Correct 1 ms 212 KB n = 13, m = 3
17 Correct 1 ms 212 KB n = 18, m = 4
18 Correct 1 ms 212 KB n = 20, m = 10
19 Correct 0 ms 212 KB n = 19, m = 10
20 Correct 1 ms 212 KB n = 100, m = 5
21 Correct 1 ms 212 KB n = 90, m = 3
22 Correct 0 ms 212 KB n = 86, m = 2
23 Correct 0 ms 212 KB n = 81, m = 4
24 Correct 0 ms 212 KB n = 89, m = 10
25 Correct 0 ms 308 KB n = 81, m = 23
26 Correct 1 ms 212 KB n = 86, m = 8
27 Correct 1 ms 212 KB n = 53, m = 22
28 Correct 0 ms 212 KB n = 89, m = 35
29 Correct 1 ms 212 KB n = 63, m = 25
30 Correct 0 ms 212 KB n = 100, m = 50
31 Correct 1 ms 212 KB n = 99, m = 50
32 Incorrect 0 ms 316 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 13, m = 1
2 Correct 0 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 0 ms 212 KB n = 1, m = 1
5 Correct 0 ms 212 KB n = 20, m = 1
6 Correct 0 ms 212 KB n = 20, m = 1
7 Correct 0 ms 212 KB n = 20, m = 1
8 Correct 0 ms 212 KB n = 20, m = 5
9 Correct 0 ms 212 KB n = 18, m = 3
10 Correct 1 ms 212 KB n = 17, m = 2
11 Correct 0 ms 212 KB n = 20, m = 2
12 Correct 0 ms 212 KB n = 17, m = 4
13 Correct 1 ms 212 KB n = 17, m = 6
14 Correct 1 ms 212 KB n = 17, m = 1
15 Correct 0 ms 212 KB n = 17, m = 4
16 Correct 1 ms 212 KB n = 13, m = 3
17 Correct 1 ms 212 KB n = 18, m = 4
18 Correct 1 ms 212 KB n = 20, m = 10
19 Correct 0 ms 212 KB n = 19, m = 10
20 Correct 1 ms 212 KB n = 100, m = 5
21 Correct 1 ms 212 KB n = 90, m = 3
22 Correct 0 ms 212 KB n = 86, m = 2
23 Correct 0 ms 212 KB n = 81, m = 4
24 Correct 0 ms 212 KB n = 89, m = 10
25 Correct 0 ms 308 KB n = 81, m = 23
26 Correct 1 ms 212 KB n = 86, m = 8
27 Correct 1 ms 212 KB n = 53, m = 22
28 Correct 0 ms 212 KB n = 89, m = 35
29 Correct 1 ms 212 KB n = 63, m = 25
30 Correct 0 ms 212 KB n = 100, m = 50
31 Correct 1 ms 212 KB n = 99, m = 50
32 Incorrect 0 ms 316 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 13, m = 1
2 Correct 0 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 0 ms 212 KB n = 1, m = 1
5 Correct 0 ms 212 KB n = 20, m = 1
6 Correct 0 ms 212 KB n = 20, m = 1
7 Correct 0 ms 212 KB n = 20, m = 1
8 Correct 0 ms 212 KB n = 20, m = 5
9 Correct 0 ms 212 KB n = 18, m = 3
10 Correct 1 ms 212 KB n = 17, m = 2
11 Correct 0 ms 212 KB n = 20, m = 2
12 Correct 0 ms 212 KB n = 17, m = 4
13 Correct 1 ms 212 KB n = 17, m = 6
14 Correct 1 ms 212 KB n = 17, m = 1
15 Correct 0 ms 212 KB n = 17, m = 4
16 Correct 1 ms 212 KB n = 13, m = 3
17 Correct 1 ms 212 KB n = 18, m = 4
18 Correct 1 ms 212 KB n = 20, m = 10
19 Correct 0 ms 212 KB n = 19, m = 10
20 Correct 1 ms 212 KB n = 100, m = 5
21 Correct 1 ms 212 KB n = 90, m = 3
22 Correct 0 ms 212 KB n = 86, m = 2
23 Correct 0 ms 212 KB n = 81, m = 4
24 Correct 0 ms 212 KB n = 89, m = 10
25 Correct 0 ms 308 KB n = 81, m = 23
26 Correct 1 ms 212 KB n = 86, m = 8
27 Correct 1 ms 212 KB n = 53, m = 22
28 Correct 0 ms 212 KB n = 89, m = 35
29 Correct 1 ms 212 KB n = 63, m = 25
30 Correct 0 ms 212 KB n = 100, m = 50
31 Correct 1 ms 212 KB n = 99, m = 50
32 Incorrect 0 ms 316 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -