oj.uz

Submission #116117

# Submission time Handle Problem Language Result Execution time Memory
116117 2019-06-10T15:50:59 Z faustaadp Dango Maker (JOI18_dango_maker) C++17
33 / 100
 1118 ms 262144 KB 
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,m,i,j,has,te;
char a[3030][3030];
int x[9000010];
int b[3000010];
bool mat[3000010];
vector<int> v[3000010];
int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			cin>>a[i][j];
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
		{
			if(j+2<=m&&a[i][j]=='R'&&a[i][j+1]=='G'&&a[i][j+2]=='W')
			{
				te++;
				has++;
				x[(i-1)*m+j]=te;
				x[(i-1)*m+j+1]=te;
				x[(i-1)*m+j+2]=te;
			}
		}
	ll hai=te;
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
		{
			if(i+2<=n&&a[i][j]=='R'&&a[i+1][j]=='G'&&a[i+2][j]=='W')
			{
				te++;
				has++;
				if(x[(i-1)*m+j]!=0)
				{
					v[x[(i-1)*m+j]].pb(te);
				}
				if(x[(i)*m+j]!=0)
				{
					v[x[(i)*m+j]].pb(te);
				}
				if(x[(i+1)*m+j]!=0)
				{
					v[x[(i+1)*m+j]].pb(te);
				}
			}				
		}
	for(i=1;i<=te;i++)
	{
		for(j=0;j<v[i].size();j++)
			if(!mat[v[i][j]])
			{
				mat[v[i][j]]=1;
				has--;
				break;
			}
	}
	cout<<has<<"\n";
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:57:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<v[i].size();j++)
           ~^~~~~~~~~~~~
dango_maker.cpp:33:5: warning: unused variable 'hai' [-Wunused-variable]
  ll hai=te;
     ^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 70780 KB Output is correct
2 Correct 63 ms 70780 KB Output is correct
3 Correct 67 ms 70776 KB Output is correct
4 Correct 62 ms 70748 KB Output is correct
5 Correct 64 ms 70776 KB Output is correct
6 Correct 63 ms 70904 KB Output is correct
7 Correct 64 ms 70776 KB Output is correct
8 Correct 65 ms 70776 KB Output is correct
9 Correct 79 ms 70776 KB Output is correct
10 Correct 67 ms 70776 KB Output is correct
11 Correct 73 ms 70904 KB Output is correct
12 Correct 67 ms 70876 KB Output is correct
13 Correct 66 ms 70776 KB Output is correct
14 Correct 65 ms 70776 KB Output is correct
15 Correct 68 ms 70776 KB Output is correct
16 Correct 70 ms 70776 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 70780 KB Output is correct
2 Correct 63 ms 70780 KB Output is correct
3 Correct 67 ms 70776 KB Output is correct
4 Correct 62 ms 70748 KB Output is correct
5 Correct 64 ms 70776 KB Output is correct
6 Correct 63 ms 70904 KB Output is correct
7 Correct 64 ms 70776 KB Output is correct
8 Correct 65 ms 70776 KB Output is correct
9 Correct 79 ms 70776 KB Output is correct
10 Correct 67 ms 70776 KB Output is correct
11 Correct 73 ms 70904 KB Output is correct
12 Correct 67 ms 70876 KB Output is correct
13 Correct 66 ms 70776 KB Output is correct
14 Correct 65 ms 70776 KB Output is correct
15 Correct 68 ms 70776 KB Output is correct
16 Correct 70 ms 70776 KB Output is correct
17 Correct 67 ms 70828 KB Output is correct
18 Correct 67 ms 70760 KB Output is correct
19 Correct 74 ms 70816 KB Output is correct
20 Correct 67 ms 70776 KB Output is correct
21 Correct 67 ms 70776 KB Output is correct
22 Correct 69 ms 70800 KB Output is correct
23 Correct 66 ms 70776 KB Output is correct
24 Correct 67 ms 70776 KB Output is correct
25 Correct 67 ms 70980 KB Output is correct
26 Correct 67 ms 70908 KB Output is correct
27 Correct 66 ms 70904 KB Output is correct
28 Correct 68 ms 70776 KB Output is correct
29 Correct 66 ms 70904 KB Output is correct
30 Correct 67 ms 71032 KB Output is correct
31 Correct 65 ms 70776 KB Output is correct
32 Correct 77 ms 70820 KB Output is correct
33 Correct 62 ms 70904 KB Output is correct
34 Correct 63 ms 70776 KB Output is correct
35 Correct 63 ms 71032 KB Output is correct
36 Correct 68 ms 70776 KB Output is correct
37 Correct 63 ms 70904 KB Output is correct
38 Correct 64 ms 70904 KB Output is correct
39 Correct 62 ms 70904 KB Output is correct
40 Correct 64 ms 70776 KB Output is correct
41 Correct 63 ms 70908 KB Output is correct
42 Correct 66 ms 70904 KB Output is correct
43 Correct 63 ms 70776 KB Output is correct
44 Correct 62 ms 70904 KB Output is correct
45 Correct 62 ms 70904 KB Output is correct
46 Correct 62 ms 70776 KB Output is correct
47 Correct 62 ms 70776 KB Output is correct
48 Correct 63 ms 70816 KB Output is correct
49 Correct 62 ms 70904 KB Output is correct
50 Correct 62 ms 70904 KB Output is correct
51 Correct 66 ms 70904 KB Output is correct
52 Correct 63 ms 70800 KB Output is correct
53 Correct 63 ms 71032 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 70780 KB Output is correct
2 Correct 63 ms 70780 KB Output is correct
3 Correct 67 ms 70776 KB Output is correct
4 Correct 62 ms 70748 KB Output is correct
5 Correct 64 ms 70776 KB Output is correct
6 Correct 63 ms 70904 KB Output is correct
7 Correct 64 ms 70776 KB Output is correct
8 Correct 65 ms 70776 KB Output is correct
9 Correct 79 ms 70776 KB Output is correct
10 Correct 67 ms 70776 KB Output is correct
11 Correct 73 ms 70904 KB Output is correct
12 Correct 67 ms 70876 KB Output is correct
13 Correct 66 ms 70776 KB Output is correct
14 Correct 65 ms 70776 KB Output is correct
15 Correct 68 ms 70776 KB Output is correct
16 Correct 70 ms 70776 KB Output is correct
17 Correct 67 ms 70828 KB Output is correct
18 Correct 67 ms 70760 KB Output is correct
19 Correct 74 ms 70816 KB Output is correct
20 Correct 67 ms 70776 KB Output is correct
21 Correct 67 ms 70776 KB Output is correct
22 Correct 69 ms 70800 KB Output is correct
23 Correct 66 ms 70776 KB Output is correct
24 Correct 67 ms 70776 KB Output is correct
25 Correct 67 ms 70980 KB Output is correct
26 Correct 67 ms 70908 KB Output is correct
27 Correct 66 ms 70904 KB Output is correct
28 Correct 68 ms 70776 KB Output is correct
29 Correct 66 ms 70904 KB Output is correct
30 Correct 67 ms 71032 KB Output is correct
31 Correct 65 ms 70776 KB Output is correct
32 Correct 77 ms 70820 KB Output is correct
33 Correct 62 ms 70904 KB Output is correct
34 Correct 63 ms 70776 KB Output is correct
35 Correct 63 ms 71032 KB Output is correct
36 Correct 68 ms 70776 KB Output is correct
37 Correct 63 ms 70904 KB Output is correct
38 Correct 64 ms 70904 KB Output is correct
39 Correct 62 ms 70904 KB Output is correct
40 Correct 64 ms 70776 KB Output is correct
41 Correct 63 ms 70908 KB Output is correct
42 Correct 66 ms 70904 KB Output is correct
43 Correct 63 ms 70776 KB Output is correct
44 Correct 62 ms 70904 KB Output is correct
45 Correct 62 ms 70904 KB Output is correct
46 Correct 62 ms 70776 KB Output is correct
47 Correct 62 ms 70776 KB Output is correct
48 Correct 63 ms 70816 KB Output is correct
49 Correct 62 ms 70904 KB Output is correct
50 Correct 62 ms 70904 KB Output is correct
51 Correct 66 ms 70904 KB Output is correct
52 Correct 63 ms 70800 KB Output is correct
53 Correct 63 ms 71032 KB Output is correct
54 Correct 63 ms 70872 KB Output is correct
55 Correct 70 ms 79700 KB Output is correct
56 Correct 63 ms 70948 KB Output is correct
57 Correct 68 ms 76792 KB Output is correct
58 Correct 93 ms 78072 KB Output is correct
59 Correct 346 ms 118364 KB Output is correct
60 Correct 321 ms 118512 KB Output is correct
61 Correct 318 ms 118528 KB Output is correct
62 Correct 63 ms 70776 KB Output is correct
63 Correct 323 ms 117168 KB Output is correct
64 Runtime error 1118 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
65 Halted 0 ms 0 KB -