제출 #1098686

#제출 시각아이디문제언어결과실행 시간메모리
1098686SulAMemory (IOI10_memory)C++17
100 / 100
2 ms612 KiB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "memory.h"
#include "grader.h"
#define bitcount __builtin_popcountll
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<long long,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update>;

void play() {
    vector<int> ind['Z'];
    for (int i = 1; i <= 50; i++) {
        ind[faceup(i)].push_back(i);
    }
    for (char c = 'A'; c <= 'Y'; c++) {
        faceup(ind[c][0]);
        faceup(ind[c][1]);
    }
}

//signed main() {
//    ios::sync_with_stdio(false);
//    cin.tie(nullptr), cout.tie(nullptr);
//
//    int N,K; cin >> N >> K;
//    int h[N-1][2], L[N-1];
//    for (int i = 0; i < N-1; cin >> h[i][0] >> h[i][1] >> L[i++]);
//    cout << best_path(N, K, h, L);
//}

컴파일 시 표준 에러 (stderr) 메시지

memory.cpp: In function 'void play()':
memory.cpp:14:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   14 |         ind[faceup(i)].push_back(i);
      |             ~~~~~~^~~
memory.cpp:17:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   17 |         faceup(ind[c][0]);
      |                    ^
memory.cpp:18:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   18 |         faceup(ind[c][1]);
      |                    ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...