Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 4 KBi |
#7 |
Correcto
|
0.006 s | 2 KBi |
#8 |
Correcto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.007 s | 5 KBi |
#11 |
Correcto
|
0.004 s | 2 KBi |
#12 |
Correcto
|
0.007 s | 2 KBi |
#13 |
Correcto
|
0.005 s | 3 KBi |
#14 |
Correcto
|
0.059 s | 3 KBi |
#15 |
Correcto
|
0.072 s | 4 KBi |
#16 |
Correcto
|
0.057 s | 4 KBi |
#17 |
Correcto
|
0.073 s | 3 KBi |
#18 |
Correcto
|
0.054 s | 3 KBi |
#19 |
Correcto
|
0.046 s | 3 KBi |
#20 |
Correcto
|
0.065 s | 3 KBi |
#include <bits/stdc++.h> #define fi first #define se second #define forn(i,n) for(int i=0; i< (int)n; ++i) #define for1(i,n) for(int i=1; i<= (int)n; ++i) #define fore(i,l,r) for(int i=(int)l; i<= (int)r; ++i) #define ford(i,n) for(int i=(int)(n) - 1; i>= 0; --i) #define fored(i,l,r) for(int i=(int)r; i>= (int)l; --i) #define pb push_back #define el '\n' #define d(x) cout<< #x<< " " << x<<el #define ri(n) scanf("%d",&n) #define sz(v) ((int)v.size()) #define all(v) v.begin(),v.end() #define allr(v) v.rbegin(),v.rend() using namespace std; typedef long long ll; typedef double ld; typedef pair<int,int> ii; typedef pair<char,int> pci; typedef tuple<int, int, int> tiii; typedef pair<ll,ll> pll; typedef vector<int> vi; const ll inf = 1e18; const int nax = 1e5+200; const double mpi = acos(-1); const double eps= 1e-10; int dr[] = {1,-1,0, 0,1,-1,-1, 1}; // trick to explore an implicit 2D grid int dc[] = {0, 0,1,-1,1, 1,-1,-1}; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout<< setprecision(20)<< fixed; int n; cin>> n; vector<int> a(n); int sum = 0; forn(i,n){ cin>> a[i]; sum+= a[i]; a[i] = sum; } forn(i,n){ if(a[i]>0 && sum-a[i]<0){ cout<< i+1<<el; return 0; } } cout<< "Impossible"<<el; }