oj.uz

답안 #229034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229034 2020-05-03T09:25:34 Z kartel Sunčanje (COCI18_suncanje) C++14
117 / 130
 4000 ms 4112 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int xr[N], xl[N], yl[N], yr[N], lx, ly, i, j, n, ans[N], sf[N], sf1[N], sf2[N], sf3[N];

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> xl[i] >> yl[i] >> lx >> ly;
        xr[i] = xl[i] + lx;
        yr[i] = yl[i] + ly;
    }

    ans[n] = 1;

    sf[n] = xr[n];
    sf1[n] = yr[n];
    sf2[n] = xl[n];
    sf3[n] = yl[n];

    for (i = n - 1; i >= 1; i--) sf[i] = max(sf[i + 1], xr[i]), sf2[i] = min(sf2[i + 1], xl[i]);
    for (i = n - 1; i >= 1; i--) sf1[i] = max(sf1[i + 1], yr[i]), sf3[i] = min(sf3[i + 1], yl[i]);

    for (i = 1; i <= n; i++)
      {
          if (min(xr[i], sf[i + 1]) <= max(sf2[i + 1], xl[i])) {ans[i] = 1;continue;}
          if (min(yr[i], sf1[i + 1]) <= max(sf3[i + 1], yl[i])) {ans[i] = 1;continue;}
          for (j = i + 1; j <= n; j++)
        {
            if (min(xr[i], xr[j]) > max(xl[i], xl[j]) &&
                min(yr[i], yr[j]) > max(yl[i], yl[j])) {ans[i] = 0;break;}
            ans[i] = 1;
        }
      }

    for (i = 1; i <= n; i++) cout << (ans[i] ? "DA" : "NE") << el;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 512 KB Output is correct
2 Correct 38 ms 640 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 888 KB Output is correct
2 Correct 1276 ms 2208 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 1272 KB Output is correct
2 Correct 1966 ms 2720 KB Output is correct

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 1636 KB Output is correct
2 Correct 1399 ms 2296 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 716 ms 2168 KB Output is correct
2 Correct 2036 ms 2700 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 2296 KB Output is correct
2 Correct 1562 ms 2608 KB Output is correct

Subtask #7
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1656 ms 2380 KB Output is correct
2 Correct 111 ms 2936 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3377 ms 3464 KB Output is correct
2 Correct 281 ms 2424 KB Output is correct

Subtask #9
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2154 ms 3368 KB Output is correct
2 Correct 3289 ms 3584 KB Output is correct

Subtask #10
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2298 ms 4112 KB Output is correct
2 Execution timed out 4065 ms 3904 KB Time limit exceeded