Submission #51311

#TimeUsernameProblemLanguageResultExecution timeMemory
51311KieranHorgan과수원 (NOI14_orchard)C++17
8 / 25
1078 ms8428 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define endl '\n' #define ll long long #define int long long #define ld long double #define pii pair<int,int> #define rand() abs((rand()<<15)|rand()) #define randll() abs(((long long)rand()<<30)|rand()) signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long seed; asm("rdtsc" : "=A"(seed)); srand(seed); int n, m; cin >> n >> m; if(n == 1) { vector<int> grid(m+1, 0); int totalOnes = 0; for(int i = 1; i <= m; i++) { cin >> grid[i]; if(grid[i]) { totalOnes++; } } for(int i = 1; i <= m; i++) grid[i] += grid[i-1]; int ans = 1ll<<29; for(int i = 1; i <= m; i++) { for(int j = i; j <= m; j++) { int sz = j+1-i; int ins = grid[j]-grid[i-1]; int cur = 0; cur += sz-ins; cur += totalOnes-ins; ans = min(ans, cur); } } cout << ans << endl; } else { } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...