Submission #1847146
Source Code Expand
#include<bits/stdc++.h> #define range(i,a,b) for(int i = (a); i < (b); i++) #define rep(i,b) for(int i = 0; i < (b); i++) #define all(a) (a).begin(), (a).end() #define show(x) cerr << #x << " = " << (x) << endl; //const int INF = 1e8; using namespace std; int oddVector(vector<int> v){ int res = 0; auto it = min_element(all(v)); for (auto i = v.begin(); i != it; i+=2) { res += max(*i, *next(i,1)); } for (auto i = next(it,1); i != v.end(); i+=2) { res += max(*i, *next(i,1)); } return res; } int countOp(vector<int> v){ if(v.size() % 2){ return oddVector(v); }else{ vector<int> dp(v.size(), 0); dp[1] = max(v[0], v[1]); range(i,1,v.size() - 1){ dp[i + 1] = max(dp[i + 1], dp[i - 1] + max(v[i], v[i + 1])); } return dp[v.size() - 1]; } } int main(){ int n; string s; cin >> n >> s; s+="00"; vector<int> v; int cnt = 0, ans = 0; rep(i,s.size() - 1){ //show(s[i]) if(s[i] == '0' && s[i + 1] == '0'){ if(cnt != 0) v.emplace_back(cnt); cnt = 0; if(v.size() < 2) continue; //for(auto i : v){ cout << i << ' '; } cout << endl; ans += countOp(v); v.clear(); }else if(s[i] == '1'){ cnt++; }else if(s[i] == '0'){ if(cnt != 0) v.emplace_back(cnt); cnt = 0; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 101 to 010 |
User | noy72 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1320 Byte |
Status | RE |
Exec Time | 115 ms |
Memory | 900 KB |
Judge Result
Set Name | Sample | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | RE | 107 ms | 644 KB |
001.txt | RE | 102 ms | 640 KB |
002.txt | RE | 105 ms | 644 KB |
003.txt | RE | 102 ms | 640 KB |
004.txt | RE | 104 ms | 640 KB |
005.txt | RE | 105 ms | 644 KB |
006.txt | RE | 101 ms | 384 KB |
007.txt | RE | 101 ms | 512 KB |
008.txt | RE | 98 ms | 256 KB |
009.txt | RE | 109 ms | 900 KB |
010.txt | AC | 18 ms | 900 KB |
011.txt | RE | 114 ms | 900 KB |
012.txt | RE | 113 ms | 900 KB |
013.txt | RE | 112 ms | 900 KB |
014.txt | RE | 113 ms | 900 KB |
015.txt | RE | 113 ms | 900 KB |
016.txt | RE | 113 ms | 900 KB |
017.txt | RE | 115 ms | 900 KB |
018.txt | RE | 113 ms | 900 KB |
019.txt | RE | 113 ms | 900 KB |
020.txt | AC | 18 ms | 900 KB |
021.txt | AC | 18 ms | 900 KB |
022.txt | RE | 114 ms | 900 KB |
023.txt | WA | 18 ms | 900 KB |
024.txt | WA | 18 ms | 900 KB |
025.txt | WA | 18 ms | 900 KB |
026.txt | RE | 114 ms | 900 KB |
027.txt | WA | 18 ms | 900 KB |
028.txt | RE | 115 ms | 900 KB |
029.txt | WA | 18 ms | 900 KB |
030.txt | WA | 18 ms | 900 KB |
031.txt | RE | 113 ms | 900 KB |
032.txt | RE | 115 ms | 900 KB |
033.txt | RE | 113 ms | 900 KB |
034.txt | RE | 113 ms | 900 KB |
035.txt | RE | 113 ms | 900 KB |
036.txt | RE | 113 ms | 900 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | WA | 1 ms | 256 KB |