Submission #752310

#TimeUsernameProblemLanguageResultExecution timeMemory
752310Sam_a17Ancient Machine (JOI21_ancient_machine)C++17
70 / 100
72 ms8240 KiB
#define _CRT_SECURE_NO_WARNINGS #include <bits/stdc++.h> //#include "temp.cpp" #include <cstdio> using namespace std; // #ifndef ONLINE_JUDGE // #define dbg(x) cerr << #x <<" "; print(x); cerr << endl; // #else // #define dbg(x) // #endif // #define sz(x) (int((x).size())) // #define len(x) (int)x.length() // #define all(x) (x).begin(), (x).end() // #define rall(x) (x).rbegin(), (x).rend() // #define clr(x) (x).clear() // #define uniq(x) x.resize(unique(all(x)) - x.begin()); // #define pb push_back // #define popf pop_front // #define popb pop_back // #define ld long double // #define ll long long // void print(long long t) {cerr << t;} // void print(int t) {cerr << t;} // void print(string t) {cerr << t;} // void print(char t) {cerr << t;} // void print(double t) {cerr << t;} // void print(unsigned long long t) {cerr << t;} // void print(long double t) {cerr << t;} // template <class T, class V> void print(pair <T, V> p); // template <class T> void print(vector <T> v); // template <class T> void print(set <T> v); // template <class T, class V> void print(map <T, V> v); // template <class T> void print(multiset <T> v); // template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";} // template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";} // template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} // template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} // template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} // template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} // template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";} // #include <ext/pb_ds/assoc_container.hpp> // using namespace __gnu_pbds; // #define nl '\n' // // for random generations // mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count()); // // mt19937 myrand(131); // // for grid problems // int dx[8] = {-1,0,1,0,1,-1,1,-1}; // int dy[8] = {0,1,0,-1,1,1,-1,-1}; // // lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6 // void fastIO() { // ios_base::sync_with_stdio(false); // cin.tie(nullptr); cout.tie(nullptr); // } // // file in/out // void setIO(string str = "") { // fastIO(); // if (str != "") { // freopen((str + ".in").c_str(), "r", stdin); // freopen((str + ".out").c_str(), "w", stdout); // } else { // // freopen("input.txt", "r", stdin); // // freopen("output.txt", "w", stdout); // } // } // // Indexed Set // template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; void Send(int a); void Anna(int N, std::vector<char> S) { int ok = 0; for(int i = 0; i < N; i++) { if(ok) { Send((S[i] == 'Z')); continue; } if(S[i] == 'X') { Send(1); ok = 1; } else { Send(0); } } }
#define _CRT_SECURE_NO_WARNINGS #include <bits/stdc++.h> //#include "temp.cpp" #include <cstdio> using namespace std; #ifndef ONLINE_JUDGE #define dbg(x) cerr << #x <<" "; print(x); cerr << endl; #else #define dbg(x) #endif #define sz(x) (int((x).size())) #define len(x) (int)x.length() #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define clr(x) (x).clear() #define uniq(x) x.resize(unique(all(x)) - x.begin()); #define blt(x) __builtin_popcount(x) #define pb push_back #define popf pop_front #define popb pop_back void print(long long t) {cerr << t;} void print(int t) {cerr << t;} void print(string t) {cerr << t;} void print(char t) {cerr << t;} void print(double t) {cerr << t;} void print(long double t) {cerr << t;} void print(unsigned long long t) {cerr << t;} template <class T, class V> void print(pair <T, V> p); template <class T> void print(vector <T> v); template <class T> void print(set <T> v); template <class T, class V> void print(map <T, V> v); template <class T> void print(multiset <T> v); template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";} template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";} template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";} template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";} #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define nl '\n' // for grid problems int dx[8] = {-1,0,1,0,1,-1,1,-1}; int dy[8] = {0,1,0,-1,1,1,-1,-1}; // lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6 void fastIO() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } // file in/out void setIO(string str = "") { fastIO(); if (str != "") { freopen((str + ".in").c_str(), "r", stdin); freopen((str + ".out").c_str(), "w", stdout); } } // Indexed Set template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; void Remove(int d); void Bruno(int N, int L, vector<int> A) { int prv = -1 , flag = 0; for(int i = 0 ; i < N ; i++){ if(A[i] == 0) continue; for(int j = i - 1; j > prv ; j--){ Remove(j); } if(flag) { Remove(i); } else { flag = i + 1; } prv = i; } for(int i = prv + 1 ; i < N ; i++) Remove(i); if(flag) Remove(flag - 1); }

Compilation message (stderr)

Bruno.cpp: In function 'void setIO(std::string)':
Bruno.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Bruno.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...