제출 #1237986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237986		ayathk	Coins (IOI17_coins)	C++20	0 / 100	2 ms	584 KiB

coins

#include <bits/stdc++.h>
#include "coins.h"
using namespace std;
#define fi first 
#define se second 
#define all(a) a.begin(),a.end()
#define pb push_back
const int maxn = 2e5+1;

vector <int> coin_flips(vector <int> b, int c){
  vector <int> d;

  for(int i = 0;i < 64;i++){
    if(i == c)break;
      if(b[i] == 1)d.push_back(i);
  }
  if(b[c] == 0)d.push_back(c);
  return d;
}
int find_coin(vector <int> b){
  int c = -1;
  for(int i = 0;i < b.size();i++){
    if(b[i]){
      c = i;
      break;
    } 
  }

  return c;
}



/*static string run_test() {
	int c;
	cin >> c;
	vector<int> b(64);
	for (int i = 0; i < 8; i++) {
		string s;
		cin >> s;
		for (int j = 0; j < 8; j++) {
			b[i * 8 + j] = int(s[j] - '0');
		}
	}
	vector<int> flips = coin_flips(b, c);
	if ((int)flips.size() == 0) {
		return "0 turn overs";
	}
	for (int i = 0; i < (int)flips.size(); i++) {
		if (flips[i] < 0 || flips[i] > 63) {
			return "cell number out of range";
		}
		b[flips[i]] = 1 - b[flips[i]];
	}
	int coin = find_coin(b);
	if (coin != c) {
		return "wrong coin";
	}
	return "ok";
}

//signed main() {
	int tests;
	cin >> tests;
	for (int t = 1; t <= tests; t++) {
		string result = run_test();
		cout << "test #" << t << ": " << result << endl;
	}
	return 0;
}
*/

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 50