# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
808855 |
2023-08-05T11:52:56 Z |
OrazB |
Friend (IOI14_friend) |
C++14 |
|
1000 ms |
8676 KB |
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
const int N = 1e5+5;
int c[N];
ll mx = 0;
vector<int> E[N];
void bit(int x, int n, int A[]){
if (x == n){
ll sum = 0;
for (int i = 0; i < n; i++){
if (c[i]){
for (auto j : E[i]) if (c[j]) return;
sum += A[i];
}
}
mx = max(mx, sum);
return;
}
for (int i = 0; i < 2; i++){
c[x] = i;
bit(x+1, n, A);
}
}
int findSample(int n, int A[], int u[], int v[]){
for (int i = 1; i < n; i++){
if (v[i] == 0 or v[i] == 2){
E[i].pb(u[i]);
E[u[i]].pb(i);
}
if (v[i] == 1 or v[i] == 2){
for (auto j : E[u[i]]){
E[i].pb(j);
E[j].pb(i);
}
}
}
bit(0, n, A);
return mx;
}
// int main ()
// {
// ios::sync_with_stdio(false);
// cin.tie(0);
// cin >> t;
// while (t--){
// }
// }
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2656 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
1 ms |
2644 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
2 ms |
2644 KB |
Output is correct |
6 |
Correct |
1 ms |
2644 KB |
Output is correct |
7 |
Correct |
1 ms |
2644 KB |
Output is correct |
8 |
Correct |
1 ms |
2644 KB |
Output is correct |
9 |
Correct |
1 ms |
2644 KB |
Output is correct |
10 |
Correct |
1 ms |
2644 KB |
Output is correct |
11 |
Correct |
1 ms |
2656 KB |
Output is correct |
12 |
Correct |
1 ms |
2664 KB |
Output is correct |
13 |
Correct |
1 ms |
2644 KB |
Output is correct |
14 |
Correct |
2 ms |
2644 KB |
Output is correct |
15 |
Correct |
1 ms |
2644 KB |
Output is correct |
16 |
Correct |
1 ms |
2644 KB |
Output is correct |
17 |
Incorrect |
1 ms |
2644 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1065 ms |
2644 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
5204 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2664 KB |
Output is correct |
4 |
Correct |
1 ms |
2644 KB |
Output is correct |
5 |
Execution timed out |
1085 ms |
2644 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2656 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2644 KB |
Output is correct |
4 |
Correct |
1 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2644 KB |
Output is correct |
6 |
Correct |
1 ms |
2644 KB |
Output is correct |
7 |
Correct |
1 ms |
2644 KB |
Output is correct |
8 |
Correct |
1 ms |
2656 KB |
Output is correct |
9 |
Execution timed out |
1082 ms |
2644 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2664 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
1 ms |
2644 KB |
Output is correct |
4 |
Correct |
1 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2660 KB |
Output is correct |
6 |
Correct |
1 ms |
2644 KB |
Output is correct |
7 |
Correct |
1 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2660 KB |
Output is correct |
9 |
Correct |
1 ms |
2656 KB |
Output is correct |
10 |
Correct |
1 ms |
2660 KB |
Output is correct |
11 |
Correct |
1 ms |
2644 KB |
Output is correct |
12 |
Runtime error |
25 ms |
8676 KB |
Execution killed with signal 11 |
13 |
Halted |
0 ms |
0 KB |
- |