# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
974425 | 2024-05-03T10:21:18 Z | vjudge1 | Ljeto (COCI21_ljeto) | C++17 | 1 ms | 356 KB |
#include<bits/stdc++.h> #include <vector> using namespace std; #define ll long long #define ld long double const ll M = 1e9+7; int main() { ll n,b=0,e=0;cin >> n;vector <vector<ll>> arr(9,vector<ll>()); while(n--){ ll a,b,c;cin >> a >> b >> c; arr[b].push_back(a); }for (ll i = 1; i <= 8; i++) { sort(arr[i].begin(),arr[i].end()); }for (ll i = 1; i <= 4; i++) { ll lt=-1; for(ll tmp : arr[i]){ if(lt!=-1&&abs(lt-tmp)<=10)b+=150; else b+=100;lt=tmp; } }for (ll i = 5; i <= 8; i++) { ll lt=-1; for(ll tmp : arr[i]){ if(lt!=-1&&abs(lt-tmp)<=10)e+=150; else e+=100;lt=tmp; } }cout << b << " " << e; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 356 KB | Output is correct |
12 | Correct | 0 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |