oj.uz

Submission #807305

# Submission time Handle Problem Language Result Execution time Memory
807305 2023-08-04T15:39:39 Z Tunglam07 Crtanje (COCI20_crtanje) C++17
0 / 50
 2 ms 760 KB 
#include<bits/stdc++.h>
using namespace std;

int main()
{
	string s;
	map<int, int> mp[101];
	long long n, pos = 0, maxx = 0, minn = 0;
	cin >> n >> s;
	for(int i = 0; i < n; i++)
	{
		if(s[i] == '+')
		{
			mp[i + 1][pos] = 2;
			++pos;
		}
		else if(s[i] == '-')
		{
			--pos;
			mp[i + 1][pos] = 1;
		}
		else if(s[i] == '=')	
		{
			mp[i + 1][pos] = 3;
		}
		maxx = max(pos, maxx);
		minn = min(pos, minn);
	}
	bool ck = 0;
	for(int j = 1; j <= n; ++j)	
	{
		if(mp[j][maxx])	
		{
			ck = 1;
		}
	}
	if(!ck)	
	{
		maxx--;
	}
	for(int i = maxx - 1; i >= minn; i--)
	{
		for(int j = 1; j <= n; ++j)
		{
			if(!mp[j][i])	
			{
				cout << ".";
			}
			else if(mp[j][i] == 1)	
			{
				cout << char(92);
			}
			else if(mp[j][i] == 2)	
			{
				cout << "/";
			}
			else	
			{
				cout << "_";
			}
		}
		cout << endl;
	}
}

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 760 KB Output isn't correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Incorrect 2 ms 724 KB Output isn't correct