# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073615 | Hugo1729 | Longest beautiful sequence (IZhO17_subsequence) | C++11 | 1 ms | 348 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>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n),k(n);
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<n;i++)cin >> k[i];
for(int i=0;i<n;i++){
if(a[i]>=256){
cout << "1\n1";
return 5412354352345;
}
}
cout << "1\n1";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |