結果

問題 No.355 数当てゲーム(2)
ユーザー firiexp
提出日時 2019-08-21 15:54:29
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,354 bytes
コンパイル時間 917 ms
コンパイル使用メモリ 91,228 KB
最終ジャッジ日時 2024-11-14 21:35:40
合計ジャッジ時間 1,491 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:59:60: error: too many initializers for 'std::array<int, 4>'
   59 |                     v.emplace_back(array<int, 4>{i, j, k, l});
      |                                                            ^
main.cpp:69:25: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::array<int, 4> >, std::array<int, 4> >::value_type' {aka 'std::array<int, 4>'} and 'int')
   69 |             cout << v[k][i];
      |                         ^
main.cpp:82:24: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::array<int, 4> >, std::array<int, 4> >::value_type' {aka 'std::array<int, 4>'} and 'int')
   82 |                 if(v[k][j] == v[i][j]) a++;
      |                        ^
main.cpp:82:35: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::array<int, 4> >, std::array<int, 4> >::value_type' {aka 'std::array<int, 4>'} and 'int')
   82 |                 if(v[k][j] == v[i][j]) a++;
      |                                   ^
main.cpp:85:32: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::array<int, 4> >, std::array<int, 4> >::value_type' {aka 'std::array<int, 4>'} and 'int')
   85 |                         if(v[i][j] == v[k][l]) b++;
      |                                ^
main.cpp:85:43: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::array<int, 4> >, std::array<int, 4> >::value_type' {aka 'std::array<int, 4>'} and 'int')
   85 |                         if(v[i][j] == v[k][l]) b++;
      |                                           ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/vector:64,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/queue:61,
                 from main.cpp:6:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
#include <chrono>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
class xor_shift {
uint32_t x, y, z, w;
public:
xor_shift() : x(static_cast<uint32_t>((chrono::system_clock::now().time_since_epoch().count())&((1LL << 32)-1))),
y(1068246329), z(321908594), w(1234567890) {};
uint32_t urand(){
uint32_t t;
t = x ^ (x << 11);
x = y; y = z; z = w;
w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
return w;
};
int rand(int n){
if(n < 0) return -rand(-n);
uint32_t t = numeric_limits<uint32_t>::max()/(n+1)*(n+1);
uint32_t e = urand();
while(e >= t) e = urand();
return static_cast<int>(e%(n+1));
}
int rand(int a, int b){
if(a > b) swap(a, b);
return a+rand(b-a);
}
};
int main() {
vector<array<int, 4>> v{};
for (int i = 0; i <= 9; ++i) {
for (int j = 0; j <= 9; ++j) {
if(i == j) continue;
for (int k = 0; k <= 9; ++k) {
if(i == k || j == k) continue;
for (int l = 0; l <= 9; ++l) {
if(i == l || j == l || k == l) continue;
v.emplace_back(array<int, 4>{i, j, k, l});
}
}
}
}
xor_shift rd;
while(true){
int k = rd.rand(v.size()-1);
for (int i = 0; i < 4; ++i) {
if(i) cout << " ";
cout << v[k][i];
}
cout << endl;
int x, y;
cin >> x >> y;
if(x == 4){
return 0;
}
vector<array<int, 4>> newv;
for (int i = 0; i < v.size(); ++i) {
if(i == k) continue;
int a = 0, b = 0;
for (int j = 0; j < 4; ++j) {
if(v[k][j] == v[i][j]) a++;
else {
for (int l = 0; l < 4; ++l) {
if(v[i][j] == v[k][l]) b++;
}
}
}
if(a == x && b == y) newv.push_back(v[i]);
}
v = newv;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0