Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 9 KBi |
#3 |
Correcto
|
0.001 s | 0 KBi |
#4 |
Correcto
|
0.008 s | 20 KBi |
#5 |
Correcto
|
0.006 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.002 s | 0 KBi |
#8 |
Correcto
|
0.001 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.002 s | 0 KBi |
#12 |
Correcto
|
0.002 s | 0 KBi |
#13 |
Correcto
|
0.002 s | 0 KBi |
#14 |
Correcto
|
0.064 s | 5 KBi |
#15 |
Correcto
|
0.077 s | 3 KBi |
#16 |
Correcto
|
0.066 s | 7 KBi |
#17 |
Correcto
|
0.096 s | 3 KBi |
#18 |
Correcto
|
0.093 s | 3 KBi |
#19 |
Correcto
|
0.064 s | 3 KBi |
#20 |
Correcto
|
0.124 s | 3 KBi |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin>>n; int arr[n]; for(int i = 0; i < n; i++) { cin>>arr[i]; } int leftSum = arr[0], rightSum = 0, k = 1; for(int j = 1; j < n; j++) { rightSum += arr[j]; } bool rightOk = rightSum < 0, leftOk = leftSum > 0; while(k < n && (!rightOk || !leftOk)) { k++; leftSum += arr[k-1]; rightSum -= arr[k-1]; leftOk = leftSum > 0; rightOk = rightSum < 0; } if(rightOk && leftOk) { cout<<k<<endl; } else { cout<<"Impossible"<<endl; } return 0; }