제출 #400127

#제출 시각아이디문제언어결과실행 시간메모리
400127dxz05가로등 (APIO19_street_lamps)C++14
20 / 100
2 ms716 KiB
#pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << "[" << H << "]"; debug_out(T...); } #ifdef dddxxz #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #define SZ(s) ((int)s.size()) #define all(x) (x).begin(), (x).end() #define revall(x) (x).rbegin(), (x).rend() clock_t startTime; double getCurrentTime() { return (double) (clock() - startTime) / CLOCKS_PER_SEC; } typedef long long ll; mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const double eps = 0.00001; const int MOD = 1e9 + 7; const int INF = 1000000101; const long long LLINF = 1223372000000000555; const int N = 5e5 + 3e2; const int M = 2222; string street; int n, q; int cnt[M][M]; void Subtask_1(){ for (int i = 0; i <= n; i++){ for (int j = i + 1; j <= n; j++){ if (street[j - 1] == '0') break; cnt[i][j] = 1; } } while (q--){ string type; cin >> type; if (type[0] == 't'){ // toggle int x; cin >> x; x--; street[x] ^= '0' ^ '1'; } else { // query int x, y; cin >> x >> y; x--, y--; cout << cnt[x][y] << endl; } for (int i = 0; i <= n; i++){ for (int j = i + 1; j <= n; j++){ if (street[j - 1] == '0') break; cnt[i][j]++; } } } exit(0); } void solve(int TC) { cin >> n >> q >> street; if (n <= 100 && q <= 100){ Subtask_1(); } } int main() { startTime = clock(); cin.tie(nullptr); cout.tie(nullptr); ios_base::sync_with_stdio(false); bool llololcal = false; #ifdef dddxxz freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); llololcal = true; #endif int TC = 1; //cin >> TC; for (int test = 1; test <= TC; test++) { //debug(test); //cout << "Case #" << test << ": "; solve(test); } if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl; return 0; }
#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...