Submission #775263

#TimeUsernameProblemLanguageResultExecution timeMemory
775263Sam_a17Land of the Rainbow Gold (APIO17_rainbow)C++17
11 / 100
664 ms1048576 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 blt __builtin_popcount #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(long double t) {cerr << t;} void print(unsigned long long t) {cerr << t;} #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define nl '\n' // Indexed Set template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; 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(vector <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> void print(Tree <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> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} // 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 == "input") { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); } else if(str != "") { freopen((str + ".in").c_str(), "r", stdin); freopen((str + ".out").c_str(), "w", stdout); } } const int N = 505, maxN = 2e5 + 10; vector<vector<int>> color; int n, m; int d1[maxN], d2[maxN]; int d[maxN]; void init(int R, int C, int sr, int sc, int M, char *S) { n = R, m = C; color.resize(n + 5); for(int i = 1; i <= n; i++) { color[i].resize(m + 5); } color[sr][sc] = 1; for (int i = 0; i < M; i++) { if (S[i] == 'W') { sc--; } if (S[i] == 'S') { sr++; } if (S[i] == 'E') { sc++; } if (S[i] == 'N') { sr--; } color[sr][sc] = 1; } if(n == 2) { color[1][0] = 1; color[2][0] = 1; for(int i = 1; i <= m; i++) { d1[i] = d1[i - 1]; if(!color[1][i] && color[1][i + 1]) { d1[i - 1]++; d1[i]++; } d2[i] = d2[i - 1]; if(color[2][i] && !color[2][i - 1]) { d2[i - 1]++; d2[i]++; } } for(int i = 1; i <= m; i++) { d[i] = d[i - 1]; if(color[1][i] && color[2][i]) { if(!color[1][i - 1] && !color[2][i - 1]) { d[i] += 1; } } else if(color[1][i] && color[2][i + 1]) { d[i] += 1; } else if(color[2][i] && color[1][i + 1]) { d[i] += 1; } } } } int st[N][N]; int colour(int ar, int ac, int br, int bc) { if(n <= 50 && m <= 50) { queue<pair<int, int>> q; for (int i = ar; i <= br; i++) { for (int j = ac; j <= bc; j++) { st[i][j] = 0; } } int qan = 0; for (int i = ar; i <= br; i++) { for (int j = ac; j <= bc; j++) { if (st[i][j] == 0 && color[i][j] == 0) { qan++; int qq = 0; q.push({ i, j }); st[i][j] = true; while (!q.empty()) { qq++; int x = q.front().first, y = q.front().second; q.pop(); if (x + 1 <= br && color[x + 1][y] == 0 && st[x + 1][y] == 0) { st[x + 1][y] = true; q.push({ x + 1, y }); } if (x - 1 >= ar && color[x - 1][y] == 0 && st[x - 1][y] == 0) { st[x - 1][y] = true; q.push({ x - 1, y }); } if (y + 1 <= bc && color[x][y + 1] == 0 && st[x][y + 1] == 0) { st[x][y + 1] = true; q.push({ x, y + 1 }); } if (y - 1 >= ac && color[x][y - 1] == 0 && st[x][y - 1] == 0) { st[x][y - 1] = true; q.push({ x, y - 1 }); } } } } } return qan; } else if(n == 2) { if(ar == br) { if(ar == 1) { int answ = d1[bc] - d1[ac - 1]; if(color[1][bc]) { answ++; } return answ; } else { int answ = d2[bc] - d2[ac - 1]; if(color[2][bc]) { answ++; } return answ; } } else { int answ = d[bc] - d[ac - 1]; if(color[1][bc] == 0 || color[2][bc] == 0) { answ++; } return answ; } } return 0; } // const int N = 105, inf = 1e9; // vector<pair<int, int>> adj[N], out[N]; // int mat[N][N]; // int b[N][N], s[N][N]; // long long dp[N][N][N]; // bool vis[N][N][N]; // int n, m, k; // int st; // void solve_() { // cin >> n >> m >> k; // bool flag = 1; // for(int i = 1; i <= n; i++) { // for(int j = 1; j <= k; j++) { // cin >> b[i][j] >> s[i][k]; // } // } // for(int i = 1; i <= m; i++) { // int u, v, k; cin >> u >> v >> k; // if(k != 1) flag = 0; // adj[u].emplace_back(v, k); // out[v].emplace_back(u, k); // } // if(flag) { // for(int st = 1; st <= n; st++) { // memset(dp, sizeof(dp), 0); // priority_queue<pair<long long, pair< pair<int, int >, int > > > q; // dp[st][0][0] = 0; // q.push({0, {{st, 0}, 0}}); // while(!q.empty()) { // auto u = q.top(); // q.pop(); // int node = u.second.first.first, item = u.second.first.second, dist = u.second.second; // if(vis[node][item][dist]) { // continue; // } // vis[node][item][dist] = true; // if(item) { // if(s[node][item] != -1) { // if(dp[node][item][dist] - s[node][item] > dp[node][0][dist]) { // dp[node][0][dist] = dp[node][item][dist] - s[node][item]; // q.push({node, 0, dist}); // } // } // } else { // } // for(auto i: adj[node]) { // } // } // } // } // } // int main() { // setIO(); // auto solve = [&](int test_case)-> void { // for(int i = 1; i <= test_case; i++) { // solve_(); // } // }; // int test_cases = 1; // // cin >> test_cases; // solve(test_cases); // return 0; // }

Compilation message (stderr)

rainbow.cpp: In function 'void setIO(std::string)':
rainbow.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
rainbow.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
rainbow.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rainbow.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...