| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 530784 |
2022-02-26T19:33:01 Z |
Leo121 |
Archery (IOI09_archery) |
C++14 |
|
78 ms |
2208 KB |
#include <bits/stdc++.h>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#define pb push_back
#define bg(v) v.begin()
#define all(v) bg(v), v.end()
#define mp make_pair
#define fi first
#define se second
#define forn(i, a, b) for(int i=int(a);i<=int(b);++i)
#define fora(i, a, b) for(int i=int(a);i>=int(b);--i)
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
const int mod = 1e9 + 7;
const int movi[4] = {1, -1, 0, 0};
const int movj[4] = {0, 0, -1, 1};
const int lim = 1e5;
struct ura{
bool primero, segundo, actual;
};
int n, r, res, minimo;
int posiciones[2 * lim + 2];
bool ocupados[lim + 2];
vector<ura> casillas;
int menor(int pos){
forn(i, 1, n){
ocupados[i] = 0;
}
int llevados = 0;
fora(i, n, 2){
if(!casillas[i - 1].actual && !casillas[i - 1].primero){
llevados ++;
}
if(!casillas[i - 1].segundo){
llevados ++;
}
if(llevados){
ocupados[i] = 1;
llevados --;
}
}
if(!casillas[0].actual && !casillas[0].primero){
llevados ++;
}
if(!casillas[0].segundo){
llevados ++;
}
fora(i, n, 2){
if(!llevados){
break;
}
if(!ocupados[i]){
ocupados[i] = 1;
llevados --;
}
}
fora(i, pos, 2){
if(!ocupados[i]){
return i;
}
}
fora(i, n, pos){
if(!ocupados[i]){
return i;
}
}
}
int mayor(int pos){
bool actual = 0;
bool primero = 0, segundo = 0, agarrarinteresado = 0;
int unos = 0;
forn(i, 1, 2 * n){
if(casillas[i - 1].primero){
unos ++;
primero = 1;
}
if(casillas[i - 1].segundo){
unos ++;
}
if(casillas[i - 1].actual){
actual = 1;
if(i == 1){
agarrarinteresado = 1;
}
}
if(i == 1){
if(unos == 2){
primero = segundo = 1;
}
else if(unos == 1){
primero = 1;
}
}
else{
if(unos > 1){
segundo = 1;
}
else if(unos == 1){
if(!primero){
segundo = 1;
swap(segundo, primero);
}
else{
if(actual){
agarrarinteresado = 1;
}
segundo = 0;
}
}
else{
if(actual){
agarrarinteresado = 1;
}
segundo = 0;
}
}
///cout << primero << " " << segundo << " " << agarrarinteresado << "\n";
if(primero && segundo){
unos --;
casillas.pb({(bool) 1, (bool) 0, (bool) 0});
}
else if(primero){
if(agarrarinteresado){
if(i >= n){
return (n - ((r - i) % n));
}
///cout << i << "\n";
casillas.pb({(bool) 0, (bool) 0, 1});
actual = agarrarinteresado = 0;
}
else{
casillas.pb({(bool) 0, (bool) 0, 0});
}
}
else{
casillas.pb({(bool) 0, (bool) 0, 1});
}
}
return 1;
}
int ronda(int pos){
casillas.clear();
forn(i, 1, pos - 1){
casillas.pb({(posiciones[i * 2] < posiciones[1]) ? (bool) 1 : (bool) 0, (posiciones[i * 2 + 1] < posiciones[1]) ? (bool) 1 : (bool) 0, (bool) 0});
}
casillas.pb({(bool) 0, (posiciones[pos * 2] < posiciones[1]) ? (bool) 1 : (bool) 0, (bool) 1});
forn(i, pos + 1, n){
casillas.pb({(posiciones[i * 2 - 1] < posiciones[1]) ? (bool) 1 : (bool) 0, (posiciones[i * 2] < posiciones[1]) ? (bool) 1 : (bool) 0, (bool) 0});
}
/**forn(i, 1, n){
cout << casillas[i - 1].primero << " " << casillas[i - 1].segundo << " " << casillas[i - 1].actual << "\n";
}*/
return (posiciones[1] < n + 2) ? mayor(pos) : menor(pos);
}
int bs(){
int li = 1, ls = n, mitad, auxiliar, res, posres;
if(posiciones[1] < n + 2){
posres = n;
res = ronda(n);
while(li <= ls){
mitad = (li + ls) / 2;
auxiliar = ronda(mitad);
if(auxiliar > res){
li = mitad + 1;
}
else{
ls = mitad - 1;
res = auxiliar;
posres = mitad;
}
}
res = ronda(posres);
li = posres + 1;
ls = n;
while(li <= ls){
mitad = (li + ls) / 2;
auxiliar = ronda(mitad);
if(auxiliar == res){
posres = mitad;
li = mitad + 1;
}
else{
ls = mitad - 1;
}
}
}
else{
posres = 1;
while(li <= ls){
mitad = (li + ls) / 2;
auxiliar = ronda(mitad);
if(auxiliar > mitad){
li = mitad + 1;
}
else{
posres = mitad;
ls = mitad - 1;
}
}
res = ronda(posres);
li = posres + 1;
ls = n;
while(li <= ls){
mitad = (li + ls) / 2;
auxiliar = ronda(mitad);
if(auxiliar == res){
posres = mitad;
li = mitad + 1;
}
else{
ls = mitad - 1;
}
}
}
return posres;
}
/**int actuales[4002];
pii objetivos[2002];
void procesar(){
if(objetivos[1].se < objetivos[1].fi){
swap(objetivos[1].fi, objetivos[1].se);
}
int ultimo = objetivos[1].se;
actuales[objetivos[1].se] = n;
forn(i, 2, n){
if(objetivos[i].se > objetivos[i].fi){
swap(objetivos[i].fi, objetivos[i].se);
}
objetivos[i - 1].se = objetivos[i].se;
actuales[objetivos[i].se] --;
}
objetivos[n].se = ultimo;
}
void armar(int primero){
int actual = 1, posicion;
objetivos[primero].se = posiciones[1];
actuales[posiciones[1]] = primero;
forn(i, 2, 2 * n){
if(actual == primero * 2){
actual ++;
}
posicion = actual / 2;
if(actual % 2){
posicion ++;
}
if(actual % 2){
objetivos[posicion].fi = posiciones[i];
}
else{
objetivos[posicion].se = posiciones[i];
}
actuales[posiciones[i]] = posicion;
actual ++;
}
}
int arre[5];
int arre2[5];
void bruta(){
int auxiliar, res;
minimo = INT_MAX;
forn(i, 1, n){
armar(i);
forn(j, 1, r){
procesar();
}
forn(j, 1, n){
if(objetivos[j].fi == posiciones[1] || objetivos[j].se == posiciones[1]){
auxiliar = j;
}
}
arre2[i] = auxiliar;
cout << auxiliar << " ";
if(auxiliar < minimo){
minimo = auxiliar;
}
if(auxiliar == minimo){
res = i;
}
}
cout << res << "\n";
}*/
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
///cin >> n >> r;
///minimo = n;
/**set<int> dif;
n = 4;
r = 11;
int iterador = 0;
forn(i, 1, 2 * n){
posiciones[i] = i;
}*/
/**do{
iterador ++;
if(posiciones[1] == 1){
cout << n << "\n";
}
else{
forn(i, 1, n){
arre[i] = ronda(i);
}
forn(i, 1, n){
cout << arre[i] << " ";
}
cout << "\n";
bruta();
bool bandera = 0;
forn(i, 1, n){
if(arre[i] != arre2[i]){
bandera = 1;
}
}
if(bandera){
break;
}
}
} while(next_permutation(posiciones + 1, posiciones + 2 * n + 1));*/
/**forn(i, 1, 2 * n){
cin >> posiciones[i];
}
cout << ronda(1) << "\n";
bruta();*/
cin >> n >> r;
minimo = n;
forn(i, 1, 2 * n){
cin >> posiciones[i];
}
if(posiciones[1] == 1){
cout << n;
return 0;
}
if(n == 1){
cout << 1;
return 0;
}
cout << bs();
return 0;
}
Compilation message
archery.cpp: In function 'int menor(int)':
archery.cpp:87:1: warning: control reaches end of non-void function [-Wreturn-type]
87 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
332 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 4 |
Incorrect |
7 ms |
588 KB |
Output isn't correct |
| 5 |
Incorrect |
78 ms |
1692 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 8 |
Incorrect |
8 ms |
588 KB |
Output isn't correct |
| 9 |
Correct |
12 ms |
716 KB |
Output is correct |
| 10 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 11 |
Correct |
14 ms |
780 KB |
Output is correct |
| 12 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 13 |
Incorrect |
16 ms |
1200 KB |
Output isn't correct |
| 14 |
Correct |
3 ms |
460 KB |
Output is correct |
| 15 |
Correct |
22 ms |
1080 KB |
Output is correct |
| 16 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 17 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 18 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 19 |
Incorrect |
2 ms |
276 KB |
Output isn't correct |
| 20 |
Correct |
3 ms |
332 KB |
Output is correct |
| 21 |
Incorrect |
8 ms |
716 KB |
Output isn't correct |
| 22 |
Correct |
17 ms |
960 KB |
Output is correct |
| 23 |
Runtime error |
17 ms |
2208 KB |
Execution killed with signal 11 |
| 24 |
Correct |
0 ms |
204 KB |
Output is correct |
| 25 |
Correct |
1 ms |
332 KB |
Output is correct |
| 26 |
Correct |
2 ms |
332 KB |
Output is correct |
| 27 |
Correct |
13 ms |
608 KB |
Output is correct |
| 28 |
Runtime error |
16 ms |
2092 KB |
Execution killed with signal 11 |
| 29 |
Correct |
1 ms |
332 KB |
Output is correct |
| 30 |
Correct |
2 ms |
332 KB |
Output is correct |
| 31 |
Correct |
9 ms |
624 KB |
Output is correct |
| 32 |
Incorrect |
34 ms |
1468 KB |
Output isn't correct |
| 33 |
Correct |
1 ms |
204 KB |
Output is correct |
| 34 |
Correct |
0 ms |
204 KB |
Output is correct |
| 35 |
Correct |
1 ms |
332 KB |
Output is correct |
| 36 |
Correct |
2 ms |
332 KB |
Output is correct |
| 37 |
Correct |
8 ms |
604 KB |
Output is correct |
| 38 |
Correct |
12 ms |
640 KB |
Output is correct |
| 39 |
Correct |
0 ms |
204 KB |
Output is correct |
| 40 |
Correct |
1 ms |
328 KB |
Output is correct |
| 41 |
Correct |
1 ms |
332 KB |
Output is correct |
| 42 |
Correct |
1 ms |
332 KB |
Output is correct |
| 43 |
Correct |
3 ms |
332 KB |
Output is correct |
| 44 |
Correct |
4 ms |
460 KB |
Output is correct |
| 45 |
Correct |
9 ms |
628 KB |
Output is correct |
| 46 |
Correct |
10 ms |
588 KB |
Output is correct |
| 47 |
Incorrect |
34 ms |
1520 KB |
Output isn't correct |
