제출 #1308995

#제출 시각아이디문제언어결과실행 시간메모리
1308995minh30082008Ancient Machine (JOI21_ancient_machine)C++20
70 / 100
42 ms6636 KiB
#include "Anna.h" #include<bits/stdc++.h> #define fi first #define se second #define FOR(i, k, n) for(int i = k; i <= n; i++) #define FOR1(i, k, n) for(int i = k; i >= n; i--) #define pb push_back #define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0) //#define vi vector<int> #define pii pair<int, int> #define vii vector<pii> #define ll long long #define vll vector<ll> #define pll pair<ll, ll> #define re return 0 #define mii map<int, int> #define input "ALONE.inp" #define output "ALONE.out" #define rf freopen(input, "r", stdin); freopen(output, "w", stdout) using namespace std; void Anna(int n, std::vector<char> s) { int vt = -1; FOR(i, 0, n - 1) if(s[i] == 'X') { vt = i; break; } if(vt == -1) { FOR(i, 0, n - 1) Send(0); return; } FOR(i, 0, vt - 1) Send(0); Send(1); FOR(i, vt + 1, n - 1) if(s[i] == 'Z') Send(1); else Send(0); return; }
#include "Bruno.h" #include<bits/stdc++.h> #define fi first #define se second #define FOR(i, k, n) for(int i = k; i <= n; i++) #define FOR1(i, k, n) for(int i = k; i >= n; i--) #define pb push_back #define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0) //#define vi vector<int> #define pii pair<int, int> #define vii vector<pii> #define ll long long #define vll vector<ll> #define pll pair<ll, ll> #define re return 0 #define mii map<int, int> #define input "ALONE.inp" #define output "ALONE.out" #define rf freopen(input, "r", stdin); freopen(output, "w", stdout) using namespace std; void Bruno(int n, int L, std::vector<int> s) { int vt = n; FOR(i, 0, n - 1) { if(s[i] == 1) { vt = i; break; } Remove(i); } if(vt == n) return; vector<int> vv; vv.pb(vt); FOR(i, vt + 1, n - 1) { if(s[i] == 1) { while(vv.size() > 1) { Remove(vv.back()); vv.pop_back(); } Remove(i); } else { vv.pb(i); } } for(auto x : vv) Remove(x); return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...