#260986 (C++14) No.5002 stick xor

• 問題: No.5002 stick xor
• ユーザー: daku9640
• 提出日時: 2018-05-27 23:45:15
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 4 ms / 1,000 ms
• コード長: 2,365 bytes
• コンパイル時間: 3,095 ms
• 実行使用メモリ: 1,584 KB
• スコア: 28,925
• 最終ジャッジ日時: 2018-05-27 23:45:20
• ジャッジサーバーID （参考情報）: judge9 /

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 1,580 KB
testcase_01	AC	4 ms; 1,580 KB
testcase_02	AC	4 ms; 1,584 KB
testcase_03	AC	3 ms; 1,584 KB
testcase_04	AC	4 ms; 1,584 KB
testcase_05	AC	4 ms; 1,580 KB
testcase_06	AC	4 ms; 1,584 KB
testcase_07	AC	3 ms; 1,580 KB
testcase_08	AC	4 ms; 1,580 KB
testcase_09	AC	4 ms; 1,584 KB
testcase_10	AC	3 ms; 1,580 KB
testcase_11	AC	4 ms; 1,584 KB
testcase_12	AC	3 ms; 1,580 KB
testcase_13	AC	4 ms; 1,580 KB
testcase_14	AC	3 ms; 1,584 KB
testcase_15	AC	3 ms; 1,580 KB
testcase_16	AC	2 ms; 1,584 KB
testcase_17	AC	3 ms; 1,584 KB
testcase_18	AC	4 ms; 1,584 KB
testcase_19	AC	4 ms; 1,580 KB
testcase_20	AC	3 ms; 1,580 KB
testcase_21	AC	4 ms; 1,580 KB
testcase_22	AC	4 ms; 1,580 KB
testcase_23	AC	4 ms; 1,580 KB
testcase_24	AC	3 ms; 1,580 KB
testcase_25	AC	4 ms; 1,584 KB
testcase_26	AC	3 ms; 1,580 KB
testcase_27	AC	4 ms; 1,584 KB
testcase_28	AC	4 ms; 1,584 KB
testcase_29	AC	4 ms; 1,584 KB
testcase_30	AC	4 ms; 1,584 KB
testcase_31	AC	4 ms; 1,580 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
void solve() {
	var(int, n, k);
	vec(int, l, k);
	vector<pii> v;
	rep(i, 0, k) {
		v.eb(mp(l[i], i));
	}
	sort(rall(v));
	vec(string, s, n);
	priority_queue<pii> c;
	rep(i, 0, n) {
		c.em(mp(count(all(s[i]), '1'), i));
	}
	vv(int, ans, k, 5, 0);
	rep(i, 0, k) {
		int a, b, cnt, num;
		tie(a, b) = v[i];
		tie(cnt, num) = c.top();
		c.pop();
		vector<pii> vp;
		int x, y;
		rep(j, 0, n - a + 1) {
			x = count(s[num].begin() + j, s[num].begin() + j + a, '1');
			vp.eb(mp(x, j));
		}
		tie(x, y) = *maxi(all(vp));
		rep(j, y, y + a) {
			s[num][j] = s[num][j] == '0' ? '1' : '0';
		}
		ans[i][0] = b;
		ans[i][1] = ans[i][3] = num + 1;
		ans[i][2] = y + 1;
		ans[i][4] = y + a;
		c.em(cnt - (x * 2 - a), num);
	}
	sort(all(ans));
	each(a, ans) {
		print(a[1], a[2], a[3], a[4]);
	}
}
int main() {
	solve();
	return 0;
}