Submission #2242236
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long lli; typedef vector<lli> vll; typedef vector<bool> vbl; typedef vector<vector<lli>> mat; typedef vector<unordered_map<lli,lli>> graph; lli k; lli n; vll a; int main(){ cin >> k; n = 50; a = vll(n); for(lli i = 0;i < n;i++) a[i] = i; for(lli i = 0;i < n;i++){ a[i] += k/n; } k %= n; for(lli i = 0;k > 0;k--,i++){ a[i] += n; for(lli j = 0;j < n;j++){ if(j != i) a[j]--; } } for(lli i = 0;i < n-1;i++){ cout << a[i] << " "; } cout << a[n-1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrease (Contestant ver.) |
User | deoxy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 614 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0, example1, example2, example3, example4 |
All | corner0, corner1, corner2, corner3, corner4, corner5, corner6, corner7, corner8, corner9, example0, example1, example2, example3, example4, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
corner0 | WA | 1 ms | 256 KB |
corner1 | WA | 1 ms | 256 KB |
corner2 | WA | 1 ms | 256 KB |
corner3 | WA | 1 ms | 256 KB |
corner4 | WA | 1 ms | 256 KB |
corner5 | WA | 1 ms | 256 KB |
corner6 | WA | 1 ms | 256 KB |
corner7 | WA | 1 ms | 256 KB |
corner8 | WA | 1 ms | 256 KB |
corner9 | WA | 1 ms | 256 KB |
example0 | WA | 1 ms | 256 KB |
example1 | WA | 1 ms | 256 KB |
example2 | WA | 1 ms | 256 KB |
example3 | WA | 1 ms | 256 KB |
example4 | WA | 1 ms | 256 KB |
rand0 | WA | 1 ms | 256 KB |
rand1 | WA | 1 ms | 256 KB |
rand2 | WA | 1 ms | 256 KB |
rand3 | WA | 1 ms | 256 KB |
rand4 | WA | 1 ms | 256 KB |
rand5 | WA | 1 ms | 256 KB |
rand6 | WA | 1 ms | 256 KB |
rand7 | WA | 1 ms | 256 KB |
rand8 | WA | 1 ms | 256 KB |
rand9 | WA | 1 ms | 256 KB |