Submission #217444

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
217444	2020-03-29 17:15:05	dimash241	Treasure (info1cup19_treasure)	C++17	100 / 100	21 ms	1416 KiB

treasure

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
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//# include <x86intrin.h>
# include <bits/stdc++.h>
//# include <ext/pb_ds/assoc_container.hpp>
//# include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
 
//template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

treasure.cpp: In function 'int main()':
treasure.cpp:69:9: warning: array subscript has type 'char' [-Wchar-subscripts]
   g[s[i]].pb(i);
         ^
treasure.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(alive.size() >= k) {
      ~~~~~~~~~~~~~^~~~
treasure.cpp:72:29: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                             ^
treasure.cpp:22:18: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                  ^
treasure.cpp:72:29: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                             ^
treasure.cpp:22:28: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                            ^
treasure.cpp:72:53: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                                                     ^
treasure.cpp:22:18: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                  ^
treasure.cpp:72:53: warning: array subscript has type 'char' [-Wchar-subscripts]
    int cnt = ub(every(g[s[i]]), i) - lb(every(g[s[i]]), alive[sz(alive)-k]);
                                                     ^
treasure.cpp:22:28: note: in definition of macro 'every'
 #define every(x) x.begin(),x.end()
                            ^
treasure.cpp:75:12: warning: array subscript has type 'char' [-Wchar-subscripts]
      g[s[i]].pop_back();
            ^

• Subtask 1: 35 / 35
• Subtask 2: 65 / 65