#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, numero1, 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 + 1){
if(!ocupados[i]){
return i;
}
}
}
int mayor(int pos){
bool numero1 = 0, actual = 0;
int unos = 1;
bool primero, segundo;
forn(i, 1, 2 * n){
if(i == 1){
primero = casillas[i - 1].primero;
segundo = casillas[i - 1].segundo;
if(primero == 1){
unos ++;
}
if(segundo == 1){
unos ++;
}
numero1 = casillas[i - 1].numero1;
actual = casillas[i - 1].actual;
} else{
if(casillas[i - 1].primero){
unos ++;
}
if(casillas[i - 1].segundo){
unos ++;
}
if(casillas[i - 1].actual){
actual = 1;
}
if(casillas[i - 1].numero1){
numero1 = 1;
}
}
if(unos > 1){
casillas.pb({1, 0, 0, 0});
unos --;
}
else if(unos == 1){
if(actual){
casillas.pb({0, 0, 0, 1});
actual = 0;
if(i >= n){
return (n - ((r - i) % n));
}
}
else{
casillas.pb({0, 0, 0, 0});
}
} else{
casillas.pb({0, 0, 0, 0});
}
}
return 1;
}
void ronda(int pos){
casillas.clear();
forn(i, 1, pos - 1){
casillas.pb({(posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 + 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] == 1 || posiciones[i * 2 + 1] == 1) ? 1 : 0, 0});
}
casillas.pb({0, (posiciones[pos * 2] < posiciones[1]) ? 1 : 0, (posiciones[pos * 2] == 1) ? 1 : 0, 1});
forn(i, pos + 1, n){
casillas.pb({(posiciones[i * 2 - 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 - 1] == 1 || posiciones[i * 2] == 1) ? 1 : 0, 0});
}
int aux;
if(posiciones[1] >= n + 2){
aux = menor(pos);
}
else{
aux = mayor(pos);
}
if(aux <= minimo){
minimo = aux;
res = pos;
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> r;
minimo = n;
forn(i, 1, 2 * n){
cin >> posiciones[i];
}
if(posiciones[1] == 1){
cout << n;
return 0;
}
forn(i, 1, n){
ronda(i);
}
cout << res;
return 0;
}
Compilation message
archery.cpp: In function 'int mayor(int)':
archery.cpp:89:10: warning: variable 'numero1' set but not used [-Wunused-but-set-variable]
89 | bool numero1 = 0, actual = 0;
| ^~~~~~~
archery.cpp: In function 'void ronda(int)':
archery.cpp:142:58: warning: narrowing conversion of '((posiciones[(i * 2)] < posiciones[1]) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
142 | casillas.pb({(posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 + 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] == 1 || posiciones[i * 2 + 1] == 1) ? 1 : 0, 0});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp:142:107: warning: narrowing conversion of '((posiciones[((i * 2) + 1)] < posiciones[1]) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
142 | casillas.pb({(posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 + 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] == 1 || posiciones[i * 2 + 1] == 1) ? 1 : 0, 0});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp:142:171: warning: narrowing conversion of '(((posiciones[(i * 2)] == 1) || (posiciones[((i * 2) + 1)] == 1)) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
142 | casillas.pb({(posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 + 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] == 1 || posiciones[i * 2 + 1] == 1) ? 1 : 0, 0});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp:144:59: warning: narrowing conversion of '((posiciones[(pos * 2)] < posiciones[1]) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
144 | casillas.pb({0, (posiciones[pos * 2] < posiciones[1]) ? 1 : 0, (posiciones[pos * 2] == 1) ? 1 : 0, 1});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp:144:95: warning: narrowing conversion of '((posiciones[(pos * 2)] == 1) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
144 | casillas.pb({0, (posiciones[pos * 2] < posiciones[1]) ? 1 : 0, (posiciones[pos * 2] == 1) ? 1 : 0, 1});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp:146:62: warning: narrowing conversion of '((posiciones[((i * 2) - 1)] < posiciones[1]) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
146 | casillas.pb({(posiciones[i * 2 - 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 - 1] == 1 || posiciones[i * 2] == 1) ? 1 : 0, 0});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp:146:107: warning: narrowing conversion of '((posiciones[(i * 2)] < posiciones[1]) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
146 | casillas.pb({(posiciones[i * 2 - 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 - 1] == 1 || posiciones[i * 2] == 1) ? 1 : 0, 0});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp:146:171: warning: narrowing conversion of '(((posiciones[((i * 2) - 1)] == 1) || (posiciones[(i * 2)] == 1)) ? 1 : 0)' from 'int' to 'bool' [-Wnarrowing]
146 | casillas.pb({(posiciones[i * 2 - 1] < posiciones[1]) ? 1 : 0, (posiciones[i * 2] < posiciones[1]) ? 1 : 0, (posiciones[i * 2 - 1] == 1 || posiciones[i * 2] == 1) ? 1 : 0, 0});
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
archery.cpp: In function 'int menor(int)':
archery.cpp:87:1: warning: control reaches end of non-void function [-Wreturn-type]
87 | }
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
91 ms |
396 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
36 ms |
332 KB |
Output is correct |
| 4 |
Execution timed out |
2088 ms |
812 KB |
Time limit exceeded |
| 5 |
Execution timed out |
2071 ms |
1744 KB |
Time limit exceeded |
| 6 |
Correct |
1 ms |
252 KB |
Output is correct |
| 7 |
Incorrect |
12 ms |
356 KB |
Output isn't correct |
| 8 |
Execution timed out |
2093 ms |
812 KB |
Time limit exceeded |
| 9 |
Execution timed out |
2095 ms |
844 KB |
Time limit exceeded |
| 10 |
Incorrect |
18 ms |
332 KB |
Output isn't correct |
| 11 |
Execution timed out |
2090 ms |
920 KB |
Time limit exceeded |
| 12 |
Correct |
113 ms |
392 KB |
Output is correct |
| 13 |
Incorrect |
698 ms |
1160 KB |
Output isn't correct |
| 14 |
Correct |
354 ms |
460 KB |
Output is correct |
| 15 |
Execution timed out |
2095 ms |
1232 KB |
Time limit exceeded |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
28 ms |
332 KB |
Output is correct |
| 18 |
Correct |
54 ms |
332 KB |
Output is correct |
| 19 |
Correct |
170 ms |
436 KB |
Output is correct |
| 20 |
Correct |
329 ms |
460 KB |
Output is correct |
| 21 |
Execution timed out |
2072 ms |
844 KB |
Time limit exceeded |
| 22 |
Execution timed out |
2089 ms |
1104 KB |
Time limit exceeded |
| 23 |
Runtime error |
16 ms |
2040 KB |
Execution killed with signal 11 |
| 24 |
Correct |
1 ms |
204 KB |
Output is correct |
| 25 |
Correct |
13 ms |
340 KB |
Output is correct |
| 26 |
Correct |
313 ms |
404 KB |
Output is correct |
| 27 |
Execution timed out |
2085 ms |
716 KB |
Time limit exceeded |
| 28 |
Runtime error |
17 ms |
1996 KB |
Execution killed with signal 11 |
| 29 |
Correct |
29 ms |
332 KB |
Output is correct |
| 30 |
Correct |
260 ms |
408 KB |
Output is correct |
| 31 |
Execution timed out |
2099 ms |
588 KB |
Time limit exceeded |
| 32 |
Execution timed out |
2081 ms |
1484 KB |
Time limit exceeded |
| 33 |
Correct |
1 ms |
332 KB |
Output is correct |
| 34 |
Correct |
1 ms |
204 KB |
Output is correct |
| 35 |
Correct |
48 ms |
332 KB |
Output is correct |
| 36 |
Correct |
67 ms |
332 KB |
Output is correct |
| 37 |
Execution timed out |
2090 ms |
588 KB |
Time limit exceeded |
| 38 |
Execution timed out |
2088 ms |
716 KB |
Time limit exceeded |
| 39 |
Correct |
1 ms |
204 KB |
Output is correct |
| 40 |
Correct |
15 ms |
332 KB |
Output is correct |
| 41 |
Correct |
48 ms |
344 KB |
Output is correct |
| 42 |
Correct |
61 ms |
348 KB |
Output is correct |
| 43 |
Correct |
265 ms |
404 KB |
Output is correct |
| 44 |
Correct |
1076 ms |
496 KB |
Output is correct |
| 45 |
Execution timed out |
2067 ms |
588 KB |
Time limit exceeded |
| 46 |
Execution timed out |
2071 ms |
716 KB |
Time limit exceeded |
| 47 |
Execution timed out |
2085 ms |
1484 KB |
Time limit exceeded |
