GoogleCodeJam2020/NestingDepth.cpp at master · nehasangeetajha/GoogleCodeJam2020 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
// MY SOLUTION TO NESTING DEPTH PROBLEM
// https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd27/0000000000209a9f

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int t,te;
    cin>>t;
    te = 0;
    string res;
	getline(cin, res);
    while(t--)
    {
        string s;
		getline(cin, s);
        int n = s.length();
        vector<int>temp(n,0);
        for(int i = 0;i<n;i++)
        {
            temp[i] = int(s[i]) - 48;
        }

        string ans("");
        int rem = 0;
        for(int i =0;i<n;i++)
        {
            if(temp[i]==0)
            {
                ans+=s[i];
            }
            if(temp[i]>0)
            {
                for(int k=0;k<temp[i];k++)
                {
                    ans+='(';
                }
                ans+=s[i];
                int tmp =temp[i];
                for (int j = i; j < n; j++)
					temp[j] -= tmp;
				rem += tmp;
            }
            if (temp[i] < 0)
			{
				for (int j = 0; j < -temp[i]; j++)
					ans += ')';
				ans += s[i];
				int shift = temp[i];
				for (int j = i; j < n; j++)
					temp[j] -= shift;
				rem += shift;
			}
        }
        for (int j = 0; j < rem; j++)
			ans += ')';

		cout << "Case #" << te + 1 << ": " << ans << endl;
		te++;
    }
}


// SANGEETA JHA