Submission #632465

#TimeUsernameProblemLanguageResultExecution timeMemory
632465LeticiaFCSLjeto (COCI21_ljeto)C++17
50 / 50
1 ms324 KiB
#include "bits/stdc++.h" #define st first #define nd second using lint = int64_t; constexpr int MOD = int(1e9) + 7; constexpr int INF = 0x3f3f3f3f; constexpr int NINF = 0xcfcfcfcf; constexpr lint LINF = 0x3f3f3f3f3f3f3f3f; const long double PI = acosl(-1.0); // Returns -1 if a < b, 0 if a = b and 1 if a > b. int cmp_double(double a, double b = 0, double eps = 1e-9) { return a + eps > b ? b + eps > a ? 0 : 1 : -1; } using namespace std; int main() { cin.tie(nullptr)->sync_with_stdio(false); vector<int> answer(2), last(10, -100); int n; cin>>n; vector<tuple<int, int, int>> spray(n); for(auto &[t, a, b]: spray) cin>>t>>a>>b; sort(spray.begin(), spray.end()); for(auto &[t, a, b]: spray){ int team = 0; if(a > 4) team = 1; answer[team] += 100; if(abs(t - last[a]) <= 10) answer[team] += 50; last[a] = t; } cout<<answer[0]<<" "<<answer[1]<<"\n"; return 0; } /* [ ]Leu o problema certo??? [ ]Ver se precisa de long long [ ]Viu o limite dos fors (é n? é m?) [ ]Tamanho do vetor, será que é 2e5 em vez de 1e5?? [ ]Testar sample [ ]Testar casos de borda [ ]1LL no 1LL << i [ ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?) */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...