oj.uz

답안 #718018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
718018 2023-04-03T07:08:36 Z hariaakas646 Self Study (JOI22_ho_t2) C++17
10 / 100
 65 ms 9028 KB 
#include <bits/stdc++.h>
#include <iostream>

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

int main()
{
    int n, m;
    scd(n);
    scd(m);
    lli mi = 1e15;
    vll vec(n);
    frange(i, n)
    {
        sclld(vec[i]);
    }
    frange(i, n)
    {
        lli a;
        sclld(a);
        vec[i] = max(vec[i], a);
    }
    mi = *min_element(all(vec));
    printf("%lld", mi);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:6:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:39:5: note: in expansion of macro 'scd'
   39 |     scd(n);
      |     ^~~
Main.cpp:6:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:40:5: note: in expansion of macro 'scd'
   40 |     scd(m);
      |     ^~~
Main.cpp:8:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
Main.cpp:45:9: note: in expansion of macro 'sclld'
   45 |         sclld(vec[i]);
      |         ^~~~~
Main.cpp:8:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
Main.cpp:50:9: note: in expansion of macro 'sclld'
   50 |         sclld(a);
      |         ^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 316 KB Output is correct
11 Correct 65 ms 8524 KB Output is correct
12 Correct 64 ms 8524 KB Output is correct
13 Correct 54 ms 6340 KB Output is correct
14 Correct 53 ms 6340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 37 ms 3788 KB Output is correct
17 Correct 63 ms 9028 KB Output is correct
18 Correct 65 ms 8396 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 37 ms 3788 KB Output is correct
3 Correct 63 ms 9028 KB Output is correct
4 Correct 65 ms 8396 KB Output is correct
5 Incorrect 1 ms 300 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 316 KB Output is correct
11 Correct 65 ms 8524 KB Output is correct
12 Correct 64 ms 8524 KB Output is correct
13 Correct 54 ms 6340 KB Output is correct
14 Correct 53 ms 6340 KB Output is correct
15 Incorrect 1 ms 300 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 316 KB Output is correct
11 Correct 65 ms 8524 KB Output is correct
12 Correct 64 ms 8524 KB Output is correct
13 Correct 54 ms 6340 KB Output is correct
14 Correct 53 ms 6340 KB Output is correct
15 Incorrect 1 ms 300 KB Output isn't correct
16 Halted 0 ms 0 KB -