oj.uz

Submission #63558

# Submission time Handle Problem Language Result Execution time Memory
63558 2018-08-02T06:30:09 Z kylych03 Homecoming (BOI18_homecoming) C++14
0 / 100
 53 ms 6244 KB 
#include <bits/stdc++.h>
using namespace std;
long long solve(int N, int K, int *A, int *B){
	int ok=1;
	long long res=0;
	 int *vis = new int[N];
	 for(int i=0;i<N;i++)
	 	vis[i]=1;
	while(ok){
		ok=0;
		
		for(int i=0;i<N;i++)
			if(vis[i]){
				int sum=0;
				for(int j=i;j<i+K;j++)
					sum+=B[j%N];
				if(sum<=A[i]){
					ok=1;
					vis[i]=0;
					if(A[i]-sum>res)
					res=A[i]-sum;
					//for(int j=i;j<i+K;j++)
					//	B[j%N]=0;
				}
			}
	}
	return res;	
}
/*
int main() {
  int T; assert(scanf("%d", &T) == 1);
  for(int t = 0; t < T; t++) {
    int N, K; assert(scanf("%d%d", &N, &K) == 2);
    int *A = new int[N];
    int *B = new int[N];
    for(int i = 0; i < N; i++) assert(scanf("%d", &A[i]) == 1);
    for(int i = 0; i < N; i++) assert(scanf("%d", &B[i]) == 1);
    printf("%lld\n", solve(N, K, A, B));
    delete[] A;
    delete[] B;
  }
  return 0;
}
*/

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 6244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -