# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
759026 | kirakosyan | Dijamant (COCI22_dijamant) | C++17 | 142 ms | 82124 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <map>
#include <string>
#include <ios>
#include <iomanip>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(NULL);
using ll = long long;
using namespace std;
void solve() {
int n, m; cin >> n >> m;
vector<string>v(n);
vector<vector<int>>a(n, vector<int>(m));
vector<vector<int>>b(n, vector<int>(m));
vector<vector<int>>c(n, vector<int>(m));
vector<vector<int>>d(n, vector<int>(m));
vector<vector<int>>pref(n, vector<int>(m));
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |