Submission #563542

#TimeUsernameProblemLanguageResultExecution timeMemory
563542zxcvbnm새로운 문제 (POI11_pio)C++14
27 / 100
1091 ms4204 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> a(n); for(int& i : a) { cin >> i; } vector<int> ans(n, 0); for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { if (i == j) continue; ans[i] = max(ans[i], (int) ceil(sqrt(abs(i-j))) - a[i] + a[j]); } } for(int i : ans) { cout << i << "\n"; } cout << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...