Skip to content

Commit d563c13

Browse files
rohitcode26rohitcode26
authored
Add files via upload
1 parent e773398 commit d563c13

8 files changed

+829
-0
lines changed

‎Alternating Subsequence.cpp

+108
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,108 @@
1+
#include<bits/stdc++.h>
2+
3+
using namespace std ;
4+
5+
typedef double D ;
6+
typedef long long ll ;
7+
typedef long double ld ;
8+
typedef unsigned int ui ;
9+
typedef unsigned long long ull ;
10+
11+
# define F first
12+
# define S second
13+
# define R return
14+
# define C continue
15+
# define pb push_back
16+
# define pf push_front
17+
# define mp make_pair
18+
19+
# define vi vector <int>
20+
# define vb vector <bool>
21+
# define vll vector <ll>
22+
# define vs vector <string>
23+
24+
# define vvi vector < vector < int > >
25+
# define vvb vector < vector < bool > >
26+
# define vvc vector < vector < char > >
27+
# define vvll vector < vector < ll > >
28+
# define vvd vector < vector < D > >
29+
# define vvld vector < vector < ld > >
30+
31+
# define pii pair < int , int >
32+
# define pll pair < ll , ll >
33+
# define pld pair < ld , ld >
34+
# define pDD pair < D , D >
35+
36+
# define vpld vector < pld >
37+
# define vpii vector < pii >
38+
# define vpll vector < pll >
39+
# define vpDD vector < pDD >
40+
# define vvpii vector < vector < pii > >
41+
42+
# define all(v) (v).begin() , (v).end()
43+
# define allrev(v) (v).rbegin() , (v).rend()
44+
# define allcomp(v) v.begin() , v.end() , comp
45+
# define allrevcomp(v) v.rbegin() , v.rend() , comp
46+
47+
# define Fi(i,L,R) for (int i = L ; i <= R ; i++)
48+
# define Fd(i,R,L) for (int i = R ; i >= L ; i--)
49+
50+
# define FAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
51+
52+
# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
53+
54+
const ll MOD = 1e9 + 7 ;
55+
const int infi = INT_MAX ;
56+
const ll infll = LLONG_MAX ;
57+
const ld PI = 3.1415926535897932384626 ;
58+
59+
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
60+
61+
void solve (int test_case)
62+
{
63+
int n ;
64+
cin >> n ;
65+
vi v (n) ;
66+
for (auto &i : v)
67+
cin >> i ;
68+
ll sum = 0 ;
69+
for (int i = 0 ; i < n ; )
70+
{
71+
int num = v[i] ;
72+
if (num < 0)
73+
{
74+
int j = i+1 ;
75+
while (v[j] < 0 && j < n)
76+
{
77+
num = max(num , v[j]) ;
78+
++j ;
79+
}
80+
i = j ;
81+
}
82+
else
83+
{
84+
int j = i + 1 ;
85+
while (v[j] > 0 && j < n)
86+
{
87+
num = max(num , v[j]) ;
88+
++j ;
89+
}
90+
i = j ;
91+
}
92+
sum += num ;
93+
}
94+
cout << sum << '\n' ;
95+
}
96+
97+
int main()
98+
{
99+
//freopen ("input.txt","r",stdin) ;
100+
//freopen ("output.txt","w",stdout) ;
101+
102+
FAST ;
103+
int tc = 1 ;
104+
cin >> tc ;
105+
while (tc--)
106+
solve (tc) ;
107+
return 0 ;
108+
}

‎Andryusha and Colored Balloons.cpp

+114
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,114 @@
1+
#include<bits/stdc++.h>
2+
3+
using namespace std ;
4+
5+
typedef double D ;
6+
typedef long long ll ;
7+
typedef long double ld ;
8+
typedef unsigned int ui ;
9+
typedef unsigned long long ull ;
10+
11+
# define F first
12+
# define S second
13+
# define R return
14+
# define C continue
15+
# define pb push_back
16+
# define pf push_front
17+
# define mp make_pair
18+
19+
# define vi vector <int>
20+
# define vb vector <bool>
21+
# define vll vector <ll>
22+
# define vs vector <string>
23+
24+
# define vvi vector < vector < int > >
25+
# define vvb vector < vector < bool > >
26+
# define vvc vector < vector < char > >
27+
# define vvll vector < vector < ll > >
28+
# define vvd vector < vector < D > >
29+
# define vvld vector < vector < ld > >
30+
31+
# define pii pair < int , int >
32+
# define pll pair < ll , ll >
33+
# define pld pair < ld , ld >
34+
# define pDD pair < D , D >
35+
36+
# define vpld vector < pld >
37+
# define vpii vector < pii >
38+
# define vpll vector < pll >
39+
# define vpDD vector < pDD >
40+
# define vvpii vector < vector < pii > >
41+
42+
# define all(v) (v).begin() , (v).end()
43+
# define allrev(v) (v).rbegin() , (v).rend()
44+
# define allcomp(v) v.begin() , v.end() , comp
45+
# define allrevcomp(v) v.rbegin() , v.rend() , comp
46+
47+
# define Fi(i,L,R) for (int i = L ; i <= R ; i++)
48+
# define Fd(i,R,L) for (int i = R ; i >= L ; i--)
49+
50+
# define FAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
51+
52+
# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
53+
54+
const ll MOD = 1e9 + 7 ;
55+
const int infi = INT_MAX ;
56+
const ll infll = LLONG_MAX ;
57+
const ld PI = 3.1415926535897932384626 ;
58+
59+
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
60+
61+
const int N = 211111 ;
62+
int n ;
63+
vi color (N , -1) ;
64+
vi adj [N] ;
65+
int k = 1 ;
66+
67+
void dfs (int node , int par)
68+
{
69+
int cur = 1 ;
70+
for (auto i : adj[node])
71+
{
72+
if (i != par) // already visited(parent) ;
73+
{
74+
while (cur == color[node] || (color[par] == cur && par != -1))
75+
++cur ;
76+
color[i] = cur ;
77+
++cur ;
78+
dfs(i , node) ;
79+
}
80+
}
81+
k = max(k , cur - 1) ;
82+
}
83+
84+
void solve (int test_case)
85+
{
86+
cin >> n ;
87+
for (int i = 0 ; i < n-1 ; ++i)
88+
{
89+
int a , b ;
90+
cin >> a >> b ;
91+
--a ;
92+
--b ;
93+
adj[a].pb(b) ;
94+
adj[b].pb(a) ;
95+
}
96+
color[0] = 1 ;
97+
dfs(0 , -1) ;
98+
cout << k << '\n' ;
99+
for (int i = 0 ; i < n ; ++i)
100+
cout << color[i] << ' ' ;
101+
}
102+
103+
int main()
104+
{
105+
//freopen ("input.txt","r",stdin) ;
106+
//freopen ("output.txt","w",stdout) ;
107+
108+
FAST ;
109+
int tc = 1 ;
110+
// cin >> tc ;
111+
while (tc--)
112+
solve (tc) ;
113+
return 0 ;
114+
}

‎Andryusha and Socks.cpp

+97
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,97 @@
1+
#include<bits/stdc++.h>
2+
3+
using namespace std ;
4+
5+
typedef double D ;
6+
typedef long long ll ;
7+
typedef long double ld ;
8+
typedef unsigned int ui ;
9+
typedef unsigned long long ull ;
10+
11+
# define F first
12+
# define S second
13+
# define R return
14+
# define C continue
15+
# define pb push_back
16+
# define pf push_front
17+
# define mp make_pair
18+
19+
# define vi vector <int>
20+
# define vb vector <bool>
21+
# define vll vector <ll>
22+
# define vs vector <string>
23+
24+
# define vvi vector < vector < int > >
25+
# define vvb vector < vector < bool > >
26+
# define vvc vector < vector < char > >
27+
# define vvll vector < vector < ll > >
28+
# define vvd vector < vector < D > >
29+
# define vvld vector < vector < ld > >
30+
31+
# define pii pair < int , int >
32+
# define pll pair < ll , ll >
33+
# define pld pair < ld , ld >
34+
# define pDD pair < D , D >
35+
36+
# define vpld vector < pld >
37+
# define vpii vector < pii >
38+
# define vpll vector < pll >
39+
# define vpDD vector < pDD >
40+
# define vvpii vector < vector < pii > >
41+
42+
# define all(v) (v).begin() , (v).end()
43+
# define allrev(v) (v).rbegin() , (v).rend()
44+
# define allcomp(v) v.begin() , v.end() , comp
45+
# define allrevcomp(v) v.rbegin() , v.rend() , comp
46+
47+
# define Fi(i,L,R) for (int i = L ; i <= R ; i++)
48+
# define Fd(i,R,L) for (int i = R ; i >= L ; i--)
49+
50+
# define FAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
51+
52+
# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
53+
54+
const ll MOD = 1e9 + 7 ;
55+
const int infi = INT_MAX ;
56+
const ll infll = LLONG_MAX ;
57+
const ld PI = 3.1415926535897932384626 ;
58+
59+
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
60+
61+
void solve (int test_case)
62+
{
63+
int n ;
64+
cin >> n ;
65+
vi v (2*n) ;
66+
set <int> st ;
67+
for (int i = 0 ; i < 2*n ; ++i)
68+
cin >> v[i] ;
69+
ll mx = -1 ;
70+
for (int i = 0 ; i < 2*n ; ++i)
71+
{
72+
if (st.count(v[i]) == 0)
73+
{
74+
st.insert(v[i]) ;
75+
}
76+
else
77+
{
78+
st.erase(v[i]) ;
79+
}
80+
ll sz = st.size() ;
81+
mx = max(sz , mx) ;
82+
}
83+
cout << mx ;
84+
}
85+
86+
int main()
87+
{
88+
//freopen ("input.txt","r",stdin) ;
89+
//freopen ("output.txt","w",stdout) ;
90+
91+
FAST ;
92+
int tc = 1 ;
93+
// cin >> tc ;
94+
while (tc--)
95+
solve (tc) ;
96+
return 0 ;
97+
}

0 commit comments

Comments
 (0)