# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
910170 | kachu | Coreputer (IOI23_coreputer) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "coreputer.h"
using namespace std;
using namespace __gnu_pbds;
#define oset tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ofind find_by_order
#define okey order_of_key
#define pque priority_queue
#define dque deque
#define que queue
#define umap unordered_map
#define uset unordered_set
#define pipii pair<int, pair<int,int>>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define iter iterator
#define endl '\n'
#define MOD 1000000007
#define INF 1e18
int[] malfunctioning_cores(int N){
int ans[N];
memset(ans, 0, sizeof ans);
if (N != 2)
return ans;
int query[1] = {0};
int res = run_diagnostic(query);
if (res == 1)
ans[0] = 1;
else if (res == -1)
ans[1] = 1;
else{
ans[0] = 1;
ans[1] = 1;
}
return ans;
}