oj.uz

Submission #209106

# Submission time Handle Problem Language Result Execution time Memory
209106 2020-03-13T08:07:38 Z ArKCa Nizin (COCI16_nizin) C++17
10 / 100
 1000 ms 8056 KB 
 #include<bits/stdc++.h>
#define  f1   first
#define  s2   second
#define  pb   push_back
#define  pob  pop_back
#define  int  ll
#define  ll   long long 
#define  PII  pair<int,int> 
#define  N    1000006
#define  mod  1000000007

using namespace std;


int n,arka,on,arkasum,onsum,ans;
int dizi[N];
int32_t main(){	    
	 // freopen("a.gir","r",stdin);
	// freopen("a.cik","w",stdout);
   //
  // 
	scanf("%lld" ,&n);
	for(int i=0;i<n;i++){
		scanf("%lld",&dizi[i]);
	}
	arka=0;
	on=n-1;
	arkasum=0;
	onsum=0;
	while(on>arka){
		if(dizi[on]==dizi[arka]){
			on--;
			arka++;
			arkasum=0;
			onsum=0;
			continue;
		}
		if(dizi[on]>dizi[arka]){
			arkasum+=dizi[arka];
			arka++;
			onsum+=dizi[on];
			on--;
		}
		while(arkasum!=onsum && on>=arka ){
			// printf("%lld %lld %lld %lld\n",on,arka,onsum,arkasum );
			if(onsum>arkasum){
				arkasum+=dizi[arka];
				arka++;
			}
			else{
				onsum+=dizi[on];
				on--;
			}
			ans++;

			// printf("%lld %lld %lld %lld\n\n",on,arka,onsum,arkasum );

		}
		if(arkasum!=onsum && on<arka)ans++;
		arkasum=0;
		onsum=0;
	}
	printf("%lld\n", ans);

}

Compilation message

nizin.cpp: In function 'int32_t main()':
nizin.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld" ,&n);
  ~~~~~^~~~~~~~~~~~
nizin.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&dizi[i]);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Execution timed out 1088 ms 128 KB Time limit exceeded

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1098 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 888 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 3064 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 6264 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 8056 KB Time limit exceeded
2 Halted 0 ms 0 KB -