Submission #99027

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
99027	2019-02-28 06:13:13	kriii	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	100 / 100	427 ms	57336 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 <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> pos[3];
int N; char S[404]; int T[404];
int X,C[3000000][3],D[3000000][3];
int tr(int i, int j, int k)
{
  return (i * (pos[1].size() + 1) + j) * (pos[2].size() + 1) + k;
}
int main()
{
  scanf ("%d",&N);
  scanf ("%s",S);
  for (int i=0;i<N;i++){
    if (S[i] == 'R') T[i] = 0;
    if (S[i] == 'G') T[i] = 1;
    if (S[i] == 'Y') T[i] = 2;
    pos[T[i]].push_back(i);
  }
  for (int i=0;i<=pos[0].size();i++) for (int j=0;j<=pos[1].size();j++) for (int k=0;k<=pos[2].size();k++){
    C[X][0] = i; C[X][1] = j; C[X][2] = k;
    D[X][0] = D[X][1] = D[X][2] = 0x7fffff;
    X++;
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:26:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<=pos[0].size();i++) for (int j=0;j<=pos[1].size();j++) for (int k=0;k<=pos[2].size();k++){
               ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:26:51: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<=pos[0].size();i++) for (int j=0;j<=pos[1].size();j++) for (int k=0;k<=pos[2].size();k++){
                                                  ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:26:86: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<=pos[0].size();i++) for (int j=0;j<=pos[1].size();j++) for (int k=0;k<=pos[2].size();k++){
                                                                                     ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:36:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int k=0;k<3;k++) if (c[k] < pos[k].size()){
                             ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d",&N);
  ~~~~~~^~~~~~~~~
joi2019_ho_t3.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%s",S);
  ~~~~~~^~~~~~~~

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