oj.uz

Submission #910174

# Submission time Handle Problem Language Result Execution time Memory
910174 2024-01-18T01:01:22 Z kachu Coreputer (IOI23_coreputer) C++17
20 / 100
 1 ms 344 KB 
#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 

vector<int> malfunctioning_cores(int N){
	vector<int> ans;
	for (int i = 0; i < N; i++)
		ans.pb(0);
		
	if (N != 2)
		return ans;
		
		
	vector<int> query;
	query.pb(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;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #2
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 0 ms 344 KB Incorrect
6 Halted 0 ms 0 KB -