Submission #865592
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <ctype.h> #include <deque> #include <queue> #include <cstring> #include <set> #include <list> #include <map> #include <random> #include <unordered_map> #include <stdio.h> using namespace std; typedef long long ll; typedef std::vector<int> vi; typedef std::vector<bool> vb; typedef std::vector<string> vs; typedef std::vector<double> vd; typedef std::vector<long long> vll; typedef std::vector<std::vector<int> > vvi; typedef vector<vvi> vvvi; typedef vector<vll> vvll; typedef std::vector<std::pair<int, int> > vpi; typedef vector<vpi> vvpi; typedef std::pair<int, int> pi; typedef std::pair<ll, ll> pll; typedef std::vector<pll> vpll; const long long mod = 1000000007; #define all(c) (c).begin(),(c).end() #define sz(c) (int)(c).size() #define forn(i, a, b) for(int i = a; i < b; i++) #define pb push_back #define mp make_pair int main() { int n; ll x; cin>>n>>x; vll a(n); forn(i,0,n) cin>>a[i]; int mind = 0; forn(i,0,n) { if(a[i] < a[mind]) mind = i; } ll INF = 1e18; vll d(n); forn(i,0,n) { d[(mind+i)%n] = ((ll)(i+1)) * a[mind] + x*(ll)i; } forn(i,1,n) { forn(j,0,n-i) { d[(mind+i+j)%n] = min(d[(mind+i+j)%n], d[(mind+i-1)%n] + ((ll)(j+1)) * a[(mind+i)%n] + x*(ll)j); } } cout<<d[(mind+n-1)%n]; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Slimes |
User | Vercingetorix |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1479 Byte |
Status | WA |
Exec Time | 21 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 4 ms | 256 KB |
0_01.txt | AC | 4 ms | 256 KB |
0_02.txt | AC | 4 ms | 256 KB |
1_00.txt | AC | 20 ms | 256 KB |
1_01.txt | AC | 20 ms | 256 KB |
1_02.txt | AC | 21 ms | 256 KB |
1_03.txt | AC | 21 ms | 256 KB |
1_04.txt | AC | 21 ms | 256 KB |
1_05.txt | AC | 21 ms | 256 KB |
1_06.txt | WA | 21 ms | 256 KB |
1_07.txt | AC | 21 ms | 256 KB |
1_08.txt | WA | 21 ms | 256 KB |
1_09.txt | AC | 21 ms | 256 KB |
1_10.txt | AC | 17 ms | 256 KB |
1_11.txt | WA | 21 ms | 256 KB |
1_12.txt | WA | 19 ms | 256 KB |
1_13.txt | WA | 15 ms | 256 KB |
1_14.txt | WA | 21 ms | 256 KB |
1_15.txt | WA | 17 ms | 256 KB |
1_16.txt | WA | 19 ms | 256 KB |
1_17.txt | WA | 21 ms | 256 KB |