Submission #159448

#	Time	Username	Problem	Language	Result	Execution time	Memory
159448		InfiniteJest	ICC (CEOI16_icc)	C++14	7 / 100	407 ms	636 KiB

icc

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include "icc.h"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
 
ifstream in("input.txt");
ofstream out("output.txt");
 
typedef long long ll;
 
int n;
vector<int> nodi[101];
bool vis[101];
bool pres[101][101];
int ar,br;
 
 
//int query(int size_a, int size_b, int a[], int b[]);
 
//void setRoad(int a, int b);
 
void dfs(int k){
  vis[k]=1;
  for(int i=0;i<(int)nodi[k].size();i++){
    if(vis[nodi[k][i]])continue;
    vis[nodi[k][i]]=1;
    dfs(nodi[k][i]);
  }
}
 
void run(int N){
  n=N;
  for(int i=0;i<n-1;i++){
    bool flag=1;
    for(int y=1;y<=n&&flag;y++){
      int tot=0;
      for(int j=1;j<=n;j++){
        vis[j]=0;
      }
      dfs(y);
      vector<int> a;
      for(int j=1;j<=n;j++){
        if(!vis[j])a.pb(j);
      }
      tot=(int)a.size();
      int f[tot];
      int g[1];
      g[0]=y;
      for(int j=0;j<tot;j++)f[j]=a[j];
      if(query(1,tot,g,f)){
        for(int j=1;j<=n;j++){
          if(vis[j])continue;
          int p[1];
          int b[1];
          p[0]=y;
          b[0]=j;
          if(query(1,1,p,b)){
            setRoad(y,j);
            nodi[y].pb(j);
            nodi[j].pb(y);
            flag=0;
            break;
          }
        }
      }
 
    }
  }
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10