Submission #757929

#TimeUsernameProblemLanguageResultExecution timeMemory
757929jer033Fruits (NOI22_fruits)C++17
5 / 100
232 ms14028 KiB
#include <algorithm> #include <iostream> int assigned[400005]; long long costs[400005]; long long answer[400005]; using namespace std; int main() { int n; cin >> n; int subtwo=1; for (int i=1; i<=n; i++) { cin >> assigned[i]; if (assigned[i]>0) subtwo=0; } if (subtwo) { answer[0]=0; for (int i=1; i<=n; i++) { cin >> costs[i]; answer[i]=answer[i-1]+costs[i]; } for (int i=0; i<n; i++) { cout << answer[n]-answer[n-1-i]; if (i!=(n-1)) cout << ' '; else 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...