Submission #345279

#TimeUsernameProblemLanguageResultExecution timeMemory
345279l3nl3UFO (IZhO14_ufo)C++14
0 / 100
176 ms71148 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #define exit exit(false) //#define here() cerr << "herewego\n"; #define show(x) cerr << #x << ": " << x << '\n'; #define int long long //#define double long double #define all(a) a.begin(), a.end() #define whole(a, p, q) a+p, a+p+q #define ioio() ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0); using namespace std; //using namespace __gnu_pbds; //typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; const int mxsz = 1e4 + 7; int n, m, r, k , p, a[mxsz][mxsz]; char tp; int x, y; signed main () { ioio(); cin >> n >> m >> r >> k >> p; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } while (k--) { cin >> tp >> x >> y; } cout << 4; }
#Verdict Execution timeMemoryGrader output
Fetching results...