oj.uz

Submission #94150

# Submission time Handle Problem Language Result Execution time Memory
94150 2019-01-16T11:51:29 Z AKaan37 Nizin (COCI16_nizin) C++14
0 / 100
 128 ms 31504 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long int lo;
typedef pair<int,int> PII;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define FOR for(lo i=1;i<=n;i++)
#define mid (start+end)/2

const lo mod = 1000000007;
const lo li = 1000001;
const lo inf = 1000000000;
const lo MAX = 1000000000000000000;
const lo MIN = -1000000000000000000;
const lo LOG = 30;

lo n,m,cev,a[li],oo,ama,kk;
vector<lo> v;

int main(){
	scanf("%lld",&n);
	FOR{
		scanf("%lld",&a[i]);
		v.pb(a[i]);
	}
	FOR{
		if(i>n/2 && n%2==1) break;
		if(i>=n/2 && n%2==0) break;
		while(v[i-1]!=v[v.size()-i]){
			if(v[i-1]>v[v.size()-i]){
				kk+=1;
				v[v.size()-i]=v[v.size()-i]+v[v.size()-i-kk];
				//~ v.erase(v.begin()+n-i-ama);
				oo++;
			}
			if(v[i-1]<v[v.size()-i]){
				ama+=1;
				v[i-1]=v[i-1]+v[i-1+ama];
				//~ v.erase(v.begin()+i-1+ama);
				oo++;
			}
			//~ cout<<"hello"<<v[0]<<" "<<v[2]<<endl;
		}
	}
	//~ cout<<"**\n";
	printf("%lld\n",oo);
	return 0;
}

Compilation message

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

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 508 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 3180 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 47 ms 11484 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 100 ms 24508 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 128 ms 31504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -