oj.uz

Submission #369272

# Submission time Handle Problem Language Result Execution time Memory
369272 2021-02-21T05:26:41 Z Berted Pilot (NOI19_pilot) C++14
0 / 100
 1000 ms 31588 KB 
#include <iostream>
using namespace std;
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int q;cin>>q;
	if (q==1)
	{
		int p,l,t;cin>>p>>l>>t;
		for (int i=0;i<l;i++) {cout<<" ";}
		for (int i=0;i<=p;i++) {cout<<"_";}
		cout<<"\n";
		for (int i=0;i<l;i++)
		{
			for (int j=0;j<l-i-1;j++) {cout<<" ";}
			cout<<"/";
			for (int j=0;j<p;j++) 
			{
				if (i<l-1) {cout<<" ";}
				else {cout<<"_";}
			}
			cout<<"/";
			for (int j = 0;j < min(i,t);j++) {cout<<" ";}
			if (i<t) {cout<<"|";}
			else {cout<<"/";}
			cout<<"\n";
		}
		for (int i=0;i<t;i++)
		{
			cout<<"|";
			for (int j=0;j<p;j++) 
			{
				if (i<t-1) {cout<<" ";}
				else {cout<<"_";}
			}
			cout<<"|";
			for (int j = 0;j < min(t-i-1,l-1);j++) {cout<<" ";}
			if (i + l <t) {cout<<"|";}
			else {cout<<"/";}
			cout<<"\n";
		}
	}
	else
	{
		int n;cin>>n;
		for (int i = 1; i <= 4*n+2; i++)
		{
			for (int j = 1; j <= 4*n+2; j++)
			{
				int val = min(min(i, 4*n + 3 - i),min(j, 4*n + 3 - j));
				if (val%2 && val < 2*n + 1) {cout<<"*";} else {cout<<" ";}
			}
			cout<<"\n";
		}
	}
	return 0;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 31284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 31588 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -