Submission #963397

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
963397	2024-04-14 23:56:20	Saul0906	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	15 / 100	2 ms	600 KiB

joi2019_ho_t3

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
#include <bits/stdc++.h>
#define ll long long
#define rep(a,b,c) for(ll a=b; a<c; a++)
#define repr(a,b,c) for(ll a=b-1; a>c-1; a--)
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>
using namespace std;
int n;
string s, s2;
int mn=1e9;
void solve(int k, int r, int y, int g, int l){
  if(y<0 || g<0 || r<0) return;
  if(!l) s2[k-1]='R';
  else if(l&1) s2[k-1]='Y';
  else s2[k-1]='G';
  if(k==n){
    int sum=0;
    pq_min(int) R, G, Y;
    rep(i,0,n){
      if(s[i]=='R') R.push(i);
      if(s[i]=='Y') Y.push(i);
      if(s[i]=='G') G.push(i);
    }
    rep(i,0,n){
      int b=0;
      if(s2[i]=='R') b=R.top(), R.pop();
      if(s2[i]=='Y') b=Y.top(), Y.pop();
      if(s2[i]=='G') b=G.top(), G.pop();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 0 / 55
• Subtask 3: 15 / 15
• Subtask 4: 0 / 25