oj.uz

답안 #245648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245648 2020-07-07T03:23:52 Z LittleFlowers__ Simurgh (IOI17_simurgh) C++17
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define gg exit(0);
 
#include "simurgh.h"
 
vector<int> find_roads(int n,vector<int> u,vector<int> v){
    vector<int> ask;
    forinc(i,0,n-2) ask.push_back(i);
    int tmp=count_common_roads(ask);
    if(tmp==n-1) return ask;
    forinc(i,n-1,u.size()-1){
        forinc(j,0,n-2){
            int rep=ask[j];
            ask[j]=i;
            int to=count_common_roads(ask);
            if(to>tmp){
              	tmp=to;
                break;
            }
            ask[j]=rep;
            if(to<tmp){
                break;
            }
        }
    }
    return ask;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB correct
2 Incorrect 5 ms 384 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB WA in grader: NO
2 Halted 0 ms 0 KB -