제출 #1162454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1162454		8pete8	Brought Down the Grading Server? (CEOI23_balance)	C++20	0 / 100	62 ms	29764 KiB

balance

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<complex>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
#define int long long
#define double long double
using namespace std;
using cd = complex<double>;
double const PI=acos(-1);
const int mod=1e9+7,mxn=5e5+5,inf=1e17,minf=-1e9,lg=15,base=311;
//#undef int
int k,m,n,q,d,S,t;
void setIO(string name){
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
vector<int>row[mxn+10],have[mxn+10];
int can[mxn+10],cnt[mxn+10],yes[mxn+10];
pii from[mxn+10];
int imbalance[mxn+10];
int tol=0;
int get(int x){
    if(abs(imbalance[x])==cnt[x])return 0;
    return abs(imbalance[x]);
}
int32_t main(){
    cin>>n>>S>>t;
    for(int i=1;i<=n;i++){
        row[i].resize(S);
        for(auto &j:row[i])cin>>j,cnt[j]++;
        imbalance[row[i][0]]++;
        imbalance[row[i][1]]--;
    }
    for(int i=1;i<=t;i++)tol+=get(i);
    for(int i=1;i<=n;i++){
        int x=get(imbalance[row[i][0]])+get(imbalance[row[i][1]]);
        imbalance[row[i][0]]-=2;
        imbalance[row[i][1]]+=2;
        int y=get(imbalance[row[i][0]])+get(imbalance[row[i][1]]);
        if(y<x)swap(row[i][0],row[i][1]),tol=tol-x+y;
        else{
            imbalance[row[i][0]]+=2;
            imbalance[row[i][1]]-=2;
        }
    }
    for(int i=1;i<=n;i++)cout<<row[i][0]<<" "<<row[i][1]<<'\n';
}
/*
knapsack for s==2?
for general case can we split into 2 valid groups (by knapsack)
then d&c down to get the answer??
how to get configuration with knapsack??
case like:
2 3
2 3
1 2
1 4
1 4
1 2
we cant take 1 and 4 to be on the same side?

can we just greedy swap??
*/

컴파일 시 표준 에러 (stderr) 메시지

balance.cpp:33:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   33 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
balance.cpp:42:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   42 | void setIO(string name){
      |                       ^
balance.cpp:52:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   52 | int get(int x){
      |              ^
balance.cpp:56:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   56 | int32_t main(){
      |              ^
balance.cpp: In function 'void setIO(std::string)':
balance.cpp:44:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         freopen((name+".in").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
balance.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         freopen((name+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2-1: 0 / 15
• Subtask 2-2: 0 / 5
• Subtask 2-3: 0 / 5
• Subtask 3-1: 0 / 15
• Subtask 3-2: 0 / 5
• Subtask 3-3: 0 / 5
• Subtask 4-1: 0 / 20
• Subtask 4-2: 0 / 10
• Subtask 4-3: 0 / 10