oj.uz

Submission #941209

# Submission time Handle Problem Language Result Execution time Memory
941209 2024-03-08T09:35:49 Z FIFI_cpp Combo (IOI18_combo) C++17
100 / 100
 14 ms 1876 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
#include "combo.h"
using ll = long long;
#define pb push_back
#define all(a) a.begin(),a.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
// xcode cant include bits/stdc++.h
using namespace std;
//ifstream fin ("fenceplan.in");
//ofstream fout ("fenceplan.out");
string guess_sequence(int N) {
    string res = "";
    string chars = "ABXY";
    if (press("AB") >= 1)
    {
        if (press("A") == 1)
        {
            res += "A";
            chars.erase(chars.begin());
        }
        else
        {
            chars.erase(chars.begin() + 1);
            res += "B";
        }
    }
    else
    {
        if (press("X") == 1)
        {
            res += "X";
            chars.erase(chars.begin() + 2);
        }
        else
        {
            res += "Y";
            chars.erase(chars.begin() + 3);
        }
    }
    for (int i = 1;i < N - 1;i++)
    {
        string ask = "";
        char askc = chars[0];
        for (int k = 0;k < 3;k++)
        {
            ask += res + askc + chars[k];
        }
        ask += res + chars[1];
        int x = press(ask);
        if (x == res.size() + 2)
            res += chars[0];
        else if (x == res.size() + 1)
            res += chars[1];
        else
            res += chars[2];
    }
    if (N >= 2)
    {
        if (press(res + chars[0]) == res.size() + 1)
        {
            res += chars[0];
        }
        else if (press(res + chars[1]) == res.size() + 1)
            res += chars[1];
        else
            res += chars[2];
    }
  return res;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:70:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         if (x == res.size() + 2)
      |             ~~^~~~~~~~~~~~~~~~~
combo.cpp:72:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         else if (x == res.size() + 1)
      |                  ~~^~~~~~~~~~~~~~~~~
combo.cpp:79:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         if (press(res + chars[0]) == res.size() + 1)
      |             ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
combo.cpp:83:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         else if (press(res + chars[1]) == res.size() + 1)
      |                  ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 356 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 532 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 11 ms 1240 KB Output is correct
18 Correct 12 ms 1528 KB Output is correct
19 Correct 12 ms 1436 KB Output is correct
20 Correct 13 ms 1376 KB Output is correct
21 Correct 13 ms 1672 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 444 KB Output is correct
26 Correct 1 ms 436 KB Output is correct
27 Correct 1 ms 440 KB Output is correct
28 Correct 1 ms 436 KB Output is correct
29 Correct 1 ms 432 KB Output is correct
30 Correct 1 ms 444 KB Output is correct
31 Correct 1 ms 432 KB Output is correct
32 Correct 13 ms 1676 KB Output is correct
33 Correct 12 ms 1264 KB Output is correct
34 Correct 11 ms 1460 KB Output is correct
35 Correct 11 ms 1528 KB Output is correct
36 Correct 11 ms 1400 KB Output is correct
37 Correct 11 ms 1616 KB Output is correct
38 Correct 13 ms 1432 KB Output is correct
39 Correct 11 ms 1112 KB Output is correct
40 Correct 14 ms 1432 KB Output is correct
41 Correct 11 ms 1500 KB Output is correct
42 Correct 12 ms 1348 KB Output is correct
43 Correct 13 ms 1684 KB Output is correct
44 Correct 11 ms 1380 KB Output is correct
45 Correct 11 ms 1156 KB Output is correct
46 Correct 12 ms 1620 KB Output is correct
47 Correct 12 ms 1844 KB Output is correct
48 Correct 11 ms 1504 KB Output is correct
49 Correct 11 ms 1488 KB Output is correct
50 Correct 12 ms 1612 KB Output is correct
51 Correct 12 ms 1468 KB Output is correct
52 Correct 12 ms 1868 KB Output is correct
53 Correct 10 ms 1444 KB Output is correct
54 Correct 11 ms 1480 KB Output is correct
55 Correct 12 ms 1500 KB Output is correct
56 Correct 11 ms 1004 KB Output is correct
57 Correct 11 ms 1876 KB Output is correct
58 Correct 10 ms 1176 KB Output is correct
59 Correct 12 ms 1392 KB Output is correct
60 Correct 12 ms 1456 KB Output is correct
61 Correct 12 ms 1364 KB Output is correct
62 Correct 11 ms 1016 KB Output is correct
63 Correct 13 ms 1256 KB Output is correct
64 Correct 11 ms 976 KB Output is correct
65 Correct 13 ms 1700 KB Output is correct
66 Correct 13 ms 1496 KB Output is correct
67 Correct 12 ms 1704 KB Output is correct
68 Correct 10 ms 820 KB Output is correct
69 Correct 12 ms 1572 KB Output is correct
70 Correct 11 ms 1520 KB Output is correct
71 Correct 13 ms 1452 KB Output is correct
72 Correct 11 ms 1748 KB Output is correct
73 Correct 11 ms 1388 KB Output is correct
74 Correct 11 ms 1212 KB Output is correct
75 Correct 12 ms 1688 KB Output is correct
76 Correct 11 ms 1252 KB Output is correct
77 Correct 13 ms 1152 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 1 ms 500 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 436 KB Output is correct
87 Correct 1 ms 436 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 1 ms 344 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 440 KB Output is correct
97 Correct 1 ms 436 KB Output is correct
98 Correct 1 ms 436 KB Output is correct
99 Correct 1 ms 440 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 1 ms 436 KB Output is correct
102 Correct 1 ms 436 KB Output is correct
103 Correct 1 ms 440 KB Output is correct
104 Correct 1 ms 388 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 1 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 1 ms 344 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 1 ms 344 KB Output is correct
120 Correct 1 ms 436 KB Output is correct
121 Correct 1 ms 432 KB Output is correct
122 Correct 1 ms 436 KB Output is correct
123 Correct 0 ms 432 KB Output is correct