oj.uz

답안 #40958

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40958 2018-02-10T13:46:33 Z Kerim 과수원 (NOI14_orchard) C++14
13 / 25
 101 ms 10508 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int arr[1000009];
int main(){
    //~ freopen("file.in", "r", stdin);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
		scanf("%d",arr+i),arr[i]+=arr[i-1];	
	if(arr[m]==m){
		puts("1");
		return 0;
	}	
	int ans=0,res=INF;
	for(int i=1;i<=m;i++){
		umin(ans,arr[i-1]*2-i);
		umin(res,arr[m]-2*arr[i]+i+1+ans);
	}	
	printf("%d\n",res);
	return 0;
}

Compilation message

orchard.cpp: In function 'int main()':
orchard.cpp:24:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
orchard.cpp:26:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",arr+i),arr[i]+=arr[i-1]; 
                                     ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 1 ms 484 KB Output is correct
4 Correct 1 ms 708 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 708 KB Output is correct
2 Correct 3 ms 788 KB Output is correct
3 Correct 3 ms 788 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 6516 KB Output is correct
2 Correct 95 ms 8500 KB Output is correct
3 Correct 101 ms 10508 KB Output is correct

Subtask #4
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 10508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 10508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 10508 KB Output isn't correct
2 Halted 0 ms 0 KB -