oj.uz

답안 #1084966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084966 2024-09-07T09:18:10 Z browntoad CEOI16_icc (CEOI16_icc) C++14
7 / 100
 228 ms 856 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
#define ll long long
// #define int ll
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define RREP1(i, n) for (int i = (n); i >= 1; i--)
#define pii pair<int, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define endl '\n'
#define IOS() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
 
const ll maxn = 105;
const ll mod = 1e9+7;
const ll inf = 1ll<<60;
 
ll mpw(ll a, ll p, ll m = mod){
    ll ret = 1;
    while(p > 0){
        if (p & 1){
            ret *= a;
            ret %= m;
        }
        p >>= 1;
        a *= a;
        a %= m;
    }
    return ret;
}
ll inv(ll a){
    return mpw(a, mod-2);
}
 
bool ex[maxn][maxn];
void run(int n){
    vector<vector<int>> cc;
    REP1(i, n){
        cc.pb({i});
    }
 
    REP(i, n-1){
        bool gg = false;
        REP1(j, n){
            if (gg) break;
            FOR(k, j+1, n+1){
                vector<int> t1 = {j};
                vector<int> t2 = {k};
                int ret = query(1, 1, &t1[0], &t2[0]);
                if (ret && !ex[j][k]){
                    setRoad(k, j);
                    ex[j][k] = 1;
                    gg = 1;
                    break;
                }
            }
        }
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 600 KB Ok! 1015 queries used.
2 Correct 43 ms 608 KB Ok! 1010 queries used.

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 218 ms 600 KB Number of queries more than 5000 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 228 ms 600 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 200 ms 856 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 188 ms 604 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 167 ms 604 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -