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;
typedef long long ll;
#define OPT ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pid pair<int,double>
#define pdi pair<double,int>
#define endl "\n"
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define inf 0x3F3F3F3F
#define bpc __builtin_popcount
#define print(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " "; cout<<endl;
int main()
{
OPT;
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for (int i = 0; i < n; i++) cin >> v[i];
for (int i = 0; i <= k; i++)
{
ll sum1 = 0;
ll sum2 = 0;
for (int j = 0; j < n; j++)
{
if (j % 4 == 0 || j % 4 == 3)
{
sum1 += v[i + j];
}
else
{
sum2 += v[i + j];
}
}
if (sum1 == sum2)
{
for (int j = 0; j < n; j++)
{
cout << v[i +j] << " ";
}
return 0;
}
}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |