# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
234166 |
2020-05-23T12:45:45 Z |
VEGAnn |
Izlet (COI19_izlet) |
C++14 |
|
514 ms |
35840 KB |
#include <bits/stdc++.h>
#define PB push_back
#define a2 array<int,2>
using namespace std;
const int N = 3010;
const int M = 1010;
const int oo = 2e9;
int ans[N], a[N][N], n, kol = 1;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#endif // _LOCAL
cin >> n;
assert(n == 2);
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> a[i][j];
ans[0] = 1;
for (int i = 1; i < n; i++){
bool ok = 0;
for (int j = i - 1; j >= 0; j--)
if (a[i][j] == i - j){
ok = 1;
ans[i] = ans[j];
break;
}
if (!ok)
ans[i] = ++kol;
}
for (int i = 0; i < n; i++)
cout << ans[i] << " ";
cout << '\n';
for (int i = 1; i < n; i++)
cout << i << " " << i + 1 << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
7 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
514 ms |
35840 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
7 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |