제출 #988959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
988959		MisalignedDiv	Archery (IOI09_archery)	C++14	2 / 100	22 ms	5592 KiB

archery

#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <vector>
#include <set>

typedef long long ll;

using namespace std;

const ll S = 500; //5e5 + 8
class Solution {
	public:
	ll N, R, mainRank;
	vector<ll> rank;
	ll help(){
		cin >> N >> R >> mainRank;
		for (int i = 1; i < 2 * N; i++){
			ll R; cin >> R; rank.push_back(R);
		}
		if (mainRank  == 1) return 1;
		if (mainRank ==  2) return (1 + R % N);
		if (mainRank == 2 * N) return (N == 1? 1 : 2);
		
		return -1;
	}
};

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	
	Solution p;
	cout << p.help() << '\n';
}

• Subtask 1: 2 / 6
• Subtask 2: 0 / 94