# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003387 | Nailuj_217 | Dijamant (COCI22_dijamant) | C++17 | 1 ms | 604 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 <bits/stdc++.h>
#define l long long
using namespace std;
const l INF = 1LL<<15;
array<vector<l>, 2005> rows;
array<l, 2005> positions;
//i is current y
//k is the x
void update(l k, l j) {
if (positions[k] == INF) return;
if (rows[k].empty()) {
positions[k] = INF;
return;
}
while (rows[k][positions[k]] < j) {
if (rows[k].size() > positions[k]+1) positions[k]++;
else positions[k] = INF;
}
}
int main() {
l n, m;
cin >> n >> m;
string row;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |