oj.uz

Submission #412064

# Submission time Handle Problem Language Result Execution time Memory
412064 2021-05-26T13:05:30 Z LptN21 Unija (COCI17_unija) C++14
100 / 100
 331 ms 54416 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ii, ii> Li;
const int N = 1e6+7, M=1e7+7;
const int MOD = 1e9+7;

int n, m, k, t;

int h[M];

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d", &n);int x, y;ll ans=0;
    memset(h, 0, sizeof h);
    for(int i=1;i<=n;i++) {
        scanf("%d%d", &x, &y);
        h[y>>1]=max(h[y>>1], x);
    }
    for(int mx=0, i=M-1;i>0;i--)
        mx=max(h[i], mx), ans+=mx;
    printf("%lld", ans<<1LL);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Compilation message

unija.cpp: In function 'int main()':
unija.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%d", &n);int x, y;ll ans=0;
      |     ~~~~~^~~~~~~~~~
unija.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%d%d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 39332 KB Output is correct
2 Correct 30 ms 39404 KB Output is correct
3 Correct 30 ms 39360 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 39348 KB Output is correct
2 Correct 32 ms 39500 KB Output is correct
3 Correct 29 ms 39372 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 39424 KB Output is correct
2 Correct 31 ms 39440 KB Output is correct
3 Correct 31 ms 39416 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 39380 KB Output is correct
2 Correct 33 ms 39480 KB Output is correct
3 Correct 32 ms 39464 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 39336 KB Output is correct
2 Correct 319 ms 54416 KB Output is correct
3 Correct 331 ms 54396 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 39372 KB Output is correct
2 Correct 30 ms 39420 KB Output is correct
3 Correct 30 ms 39420 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 39408 KB Output is correct
2 Correct 36 ms 39720 KB Output is correct
3 Correct 37 ms 39772 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 39300 KB Output is correct
2 Correct 54 ms 40816 KB Output is correct
3 Correct 56 ms 40812 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 39408 KB Output is correct
2 Correct 102 ms 43364 KB Output is correct
3 Correct 109 ms 43504 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 39408 KB Output is correct
2 Correct 322 ms 54396 KB Output is correct
3 Correct 331 ms 54380 KB Output is correct