# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997492 | MuhammadSaram | Split the sequence (APIO14_sequence) | C++17 | 180 ms | 14344 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.
// Time: 12-06-2024 16:32:12
// Problem: B - Split the sequence
// Contest: Virtual Judge - APIO 2014
// URL: https://vjudge.net/contest/633835#problem/B
// Memory Limit: 128 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int n,k,su=0;
cin>>n>>k;
int a[n],ans=0,pre[n+1]={};
for (int i=0;i<n;i++)
{
cin>>a[i];
su+=a[i];
ans-=a[i]*a[i];
pre[i+1]=su;
}
ans+=su*su;
ans/=2;
set<pair<int,int>> se;
map<int,pair<int,int>> bar;
for (int i=0;i<n-1;i++)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |